A fast digit based Montgomery multiplier designed for FPGAs with DSP resources

被引:4
作者
Ozcan, Erdem [1 ,2 ]
Erdem, Serdar S. [1 ]
机构
[1] Gebze Tech Univ, Dept Elect Engn, PK 141, TR-41400 Gebze, Kocaeli, Turkey
[2] Informat & Informat Secur Res Ctr BILGEM, TR-41470 Gebze, Kocaeli, Turkey
关键词
Montgomery modular multiplication; Carry-select addition; FPGA; DSP; RSA cryptosystem; MODULAR MULTIPLICATION; SCALABLE ARCHITECTURE; RSA CRYPTOSYSTEM; CRYPTOGRAPHY; REDUCTION; ALGORITHM;
D O I
10.1016/j.micpro.2018.06.015
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A fast Montgomery multiplier design utilizing the DSP resources in modem FPGAs is presented. In the proposed design, the operand size is the multiples of 528 bits and the digit size is 48 bits. The design has 48 x 48 bit digit multipliers built from the DSP slices performing 24 x 16 bit multiplications and a carry select accumulator built from the DSP slices performing 48 bit additions. The proposed Montgomery multiplier works iteratively. In each iteration, a digit of an operand is multiplied by the digits of the other, the result is accumulated, and reduced by Montgomery method. An iteration takes not one but eight cycles to keep the digit multiplier count low and save some hardware resources. The proposed design is implemented for Virtex-7 FPGAs. The performance results are comparable with the best results in the literature. Substantial savings in FPGA logic resources are obtained.
引用
收藏
页码:12 / 19
页数:8
相关论文
共 26 条
[1]   Compact modular exponentiation accelerator for modern FPGA devices [J].
Alho, Timo ;
Hamalainen, Panu ;
Hannikainen, Marko ;
Hamalainen, Timo D. .
COMPUTERS & ELECTRICAL ENGINEERING, 2007, 33 (5-6) :383-391
[2]   Flexible FPGA-Based Architectures for Curve Point Multiplication over GF(p) [J].
Amiet, Dorian ;
Curiger, Andreas ;
Zbinden, Paul .
19TH EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN (DSD 2016), 2016, :107-114
[3]  
Bo S., 2011, International Journal of Networking and Computing, V1, P277
[4]  
Bo Song, 2010, Proceedings 2010 First International Conference on Networking and Computing (ICNC 2010), P140, DOI 10.1109/IC-NC.2010.56
[5]   NEW DIRECTIONS IN CRYPTOGRAPHY [J].
DIFFIE, W ;
HELLMAN, ME .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) :644-654
[6]   A General Digit-Serial Architecture for Montgomery Modular Multiplication [J].
Erdem, Serdar Suer ;
Yanik, Tugrul ;
Celebi, Anil .
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2017, 25 (05) :1658-1668
[7]   An improved unifled scalable radix-2 Montgomery multiplier [J].
Harris, D ;
Krishnamurthy, R ;
Anders, M ;
Mathew, S ;
Hsu, S .
17TH IEEE SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 2005, :172-178
[8]   New Hardware Architectures for Montgomery Modular Multiplication Algorithm [J].
Huang, Miaoqing ;
Gaj, Kris ;
El-Ghazawi, Tarek .
IEEE TRANSACTIONS ON COMPUTERS, 2011, 60 (07) :923-936
[9]   Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods [J].
Knezevic, Miroslav ;
Vercauteren, Frederik ;
Verbauwhede, Ingrid .
IEEE TRANSACTIONS ON COMPUTERS, 2010, 59 (12) :1715-1721
[10]  
Kolbitz N., 1987, MATH COMPUT, V48, P203, DOI DOI 10.1090/S0025-5718-1987-0866109-5