DocumentCode :
242153
Title :
New word-based montgomery algorithm for higher radices
Author :
Tian Wang ; Xiaoxin Cui ; Kai Liao ; Nan Liao
Author_Institution :
Inst. of Microelectron., Peking Univ., Beijing, China
fYear :
2014
fDate :
28-31 Oct. 2014
Firstpage :
1
Lastpage :
3
Abstract :
Montgomery algorithm is widely used in public-key cryptosystems. In this paper a new word-based Montgomery algorithm suitable for higher radices has been presented and a new modular multiplication block based on it has been designed. The latency between neighboring processing elements can be reduced to one clock period by deferring the calculation of several bits of each word to the next processing element. The radix 2, 4 and 8 modular multiplication block has been implemented with SMIC 0.13um technology and Xilinx Virtex II series FPGA. The proposed design with radix 2 and 4 achieves area reduction with almost the same performance in speed, compared to other designs of the same radix. And the radix-8 block gains at least 10% time reduction in completing a 1024-bit Montgomery multiplication.
Keywords :
digital arithmetic; field programmable gate arrays; public key cryptography; 1024-bit Montgomery multiplication; SMIC 0.13um technology; Xilinx Virtex II series FPGA; clock period; higher radices; modular multiplication block; neighboring processing elements; public-key cryptosystems; word-based Montgomery algorithm; Abstracts; Adders; Arrays; Clocks; Cryptography; Hardware; Hardware design languages;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Solid-State and Integrated Circuit Technology (ICSICT), 2014 12th IEEE International Conference on
Conference_Location :
Guilin
Print_ISBN :
978-1-4799-3296-2
Type :
conf
DOI :
10.1109/ICSICT.2014.7021502
Filename :
7021502
Link To Document :
بازگشت