Low-Latency Scalable Radix-4 Montgomery Multiplier for Public Key Cryptosystem

• Main Authors: Sheng-HongWang, 王聖宏
• Other Authors: Ming-Der Shieh
• Format: Others
• Language: zh-TW
• Published: 2012
• Online Access: http://ndltd.ncl.edu.tw/handle/32617551013395731122

碩士 === 國立成功大學 === 電機工程學系碩博士班 === 100 === Modular multiplication is widely applied to public key cryptosystems like Rivest-Sharmir-Adleman (RSA) and elliptic curve cryptography (ECC).Modular multiplication is always an important and crucial operation in public key cryptosystems. Among existing modular multiplication algorithms, Montgomery’s modular multiplication algorithm is known as a very efficient method for carrying out modular multiplication. This work presents a word-based Booth encoded radix-4 Montgomery modular multiplication algorithm for low-latency scalable architecture. The data dependency resulting from the inherent right shifting of the intermediate results in the conventional radix-4 Montgomery modular multiplication algorithm is alleviated; thus the latency between neighboring process elements (PEs) is exactly one cycle regardless of the chosen word size. Moreover, the number of the equivalent operands in the accumulation is not increased with operand reduction scheme. Implementation results show that compared to other Booth encoded radix-4 Montgomery modular multipliers, the proposed design can achieve at least 26.5% time reduction for accomplishing one 1024-bit Montgomery modular multiplication.