Implementation of RSA cryptoprocessor based on Montgomery algorithm
Deng Yuliang, Mao Zhigang, Yizheng Ye, Tao Wang · 2002
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.