Implementation of RSA cryptoprocessor based on Montgomery algorithm
暂无分享，去创建一个
The RSA algorithm is a major method in implementing a public key cryptosystem. On the basis that the Montgomery algorithm can modular-multiply in a fast way, this paper presents a hardware implementation of a 1024-bit RSA cryptoprocessor. It has been shown that the processor can encrypt 1024 bit message in less than 0.65 seconds, with which a 3 mm/sup 2/ die area. It is suitable for smart IC cards.
[1] T. Noguchi,et al. A 15-ns 32*32-b CMOS multiplier with an improved parallel structure , 1990 .
[2] Keng L. Wong,et al. A PLL clock generator with 5 to 110 MHz of lock range for microprocessors , 1992 .
[3] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[4] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.