Fast Scalable Look-up Table Modular Multiplication Used in RSA

• Main Authors: Tian-Yiou Wu, 吳天佑
• Other Authors: De-Sheng Chen
• Format: Others
• Language: zh-TW
• Published: 2013
• Online Access: http://ndltd.ncl.edu.tw/handle/98277674272064995625

碩士 === 逢甲大學 === 產業研發碩士班 === 101 === With the renovating development of the network technology, the transmission of information has become more convenient and faster; therefore, in the process of network information transmission, information encryption has to be indispensable. Moreover, because of the popularization of the smart phones, how to effectively proceed with information encryption has become a very important issue. RSA is a public key encryption and decryption algorithm which provides rather high security and great popularization, in which the RSA is the modular exponentiation. Because the computing power has become stronger and stronger, the encryption key length has also become longer and longer, which creates a very big problem, that is, the process of encryption has become very difficult and very slow. Therefore, based on the features of the RSA modular exponentiation, this paper presents a set of new hardware architecture to solve the problem of computation time. First, we choose scalable look-up table modular multiplication to serve as kernel unit and improve it. Furthermore, by means of the features of data reuse, we can effectively reduce computation times and further achieve the effect of speeding up the modular exponentiation.