Skip to Main Content
A new version of Montgomery's algorithm or modular multiplication of large integers is presented in this paper. And a 64-bit parallel carry look-ahead binary adder implemented by SRCMOS (self-resetting CMOS) circuits substitutes for the CPA and one of the two CSAs, which are needed in the previous implementation. And then we can get the modular multiplication result after the loop without the final comparison achieved by making the size of r two nits larger than that of N. In addition, SRCMOS circuits have lower power, faster switching speed and less area than equivalent static CMOS implementations, so we can get a high performance RSA cryptosystem.
ASIC, 2003. Proceedings. 5th International Conference on (Volume:2 )
Date of Conference: 21-24 Oct. 2003