An Efficient Implementation of Montgomery Multiplication |
Author(s): |
| MANASADEVI R N , U.B.D.T COLLEGE OF ENGINEERING, DAVANGERE; Ravindra P Rajput, U.B.D.T COLLEGE OF ENGINEERING, DAVANGERE |
Keywords: |
| Encryption, Decryption, RSA, Montgomery Multiplication |
Abstract |
|
To achieve information security in communication systems a method called Cryptography has been used. There are several methods in the cryptography and one among them is RSA algorithm. In this algorithm modular multiplication is used, which is the most critical part to implement either through software or hardware. Therefore, we proposed a1new method 0 for modular 7 multiplication called as Montgomery5multiplication. Simulation results show the reduction in the number of logic gates and improvement in the performance compared to modular multiplication. |
Other Details |
|
Paper ID: IJSRDV3I70414 Published in: Volume : 3, Issue : 7 Publication Date: 01/10/2015 Page(s): 743-745 |
Article Preview |
|
|
|
|
