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 条
[11]   Low-Cost High-Performance VLSI Architecture for Montgomery Modular Multiplication [J].
Kuang, Shiann-Rong ;
Wu, Kun-Yi ;
Lu, Ren-Yao .
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2016, 24 (02) :434-443
[12]   Energy-Efficient High-Throughput Montgomery Modular Multipliers for RSA Cryptosystems [J].
Kuang, Shiann-Rong ;
Wang, Jiun-Ping ;
Chang, Kai-Cheng ;
Hsu, Huan-Wei .
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2013, 21 (11) :1999-2009
[13]   Modified Montgomery modular multiplication and RSA exponentiation techniques [J].
McIvor, C ;
McLoone, M ;
McCanny, JV .
IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2004, 151 (06) :402-408
[14]   USE OF ELLIPTIC-CURVES IN CRYPTOGRAPHY [J].
MILLER, VS .
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 218 :417-426
[15]  
MONTGOMERY PL, 1985, MATH COMPUT, V44, P519, DOI 10.1090/S0025-5718-1985-0777282-X
[16]   Scalable GF(p) Montgomery multiplier based on a digit-digit computation approach [J].
Morales-Sandoval, M. ;
Diaz-Perez, A. .
IET COMPUTERS AND DIGITAL TECHNIQUES, 2016, 10 (03) :102-109
[17]   High-Throughput Modular Multiplication and Exponentiation Algorithms Using Multibit-Scan-Multibit-Shift Technique [J].
Rezai, Abdalhossein ;
Keshavarzi, Parviz .
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2015, 23 (09) :1710-1719
[18]  
RIVEST RL, 1978, COMMUN ACM, V21, P120, DOI 10.1145/357980.358017
[19]   A new modular exponentiation architecture for efficient design of RSA cryptosystem [J].
Shieh, Ming-Der ;
Chen, Jun-Hong ;
Wu, Hao-Hsuan ;
Lin, Wen-Ching .
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2008, 16 (09) :1151-1161
[20]   Word-Based Montgomery Modular Multiplication Algorithm for Low-Latency Scalable Architectures [J].
Shieh, Ming-Der ;
Lin, Wen-Ching .
IEEE TRANSACTIONS ON COMPUTERS, 2010, 59 (08) :1145-1151