Performance analysis of Montgomery multiplier for public key cryptosystem
Sandeep Kakde, G. Somulu, Pravin P. Zode · 2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT) · 2013
Modular multiplication finds the major role in RSA Cryptography and Elliptical Curve Cryptography. Timing analysis measures the delay along the various timing paths and verifies the performance and operation of the design. We have implemented a 256-bit Modular multiplier using Montgomery Reduction Algorithm in VHDL. The output of the Montgomery multiplier is Z=X∗Y R−1mod M. Both RSA key generation component and data encryption component are too big to fit into a single Altera Cyclone II Device on Field Programmable platform, so that we are unable to test them in real hardware. However, each sub-component was simulated in Model-Sim SE 6.0 and Altera Quartus II 8.0 and proved functionally correct.