Abstract
Modular multiplication is initial operation for modular exponention to generate public key cryptography schemes. The modular exponentiation can be defined by repeated operation of modular multiplication. The performance of any public key cryptography system like RSA, ECC, is determined by the efficient implementation of the modular multiplication. Encryption/Decryption processes are time consuming so it is necessary to reduce time requirement and Area-Delay Product (ADP) of modular multiplications operation. To speed up the computation, Montgomery modular multiplication algorithm is used; this algorithm does all the process without using a trial division. Precomputation of the quotient is used to reduce the ADP (Area Delay Product). We proposed an algorithm which reduces ADP and speed up all operation. This algorithm supports up to 512-bits. Our proposed algorithm reduces ADP (area delay product) 28.18% and 42.94% compared to normal and fast Montgomery algorithm respectively.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call