Embedment of Montgomery Algorithm on Elliptic Curve Cryptography over RSA Public Key Cryptography

详细信息    查看全文

• 作者：Aswathi Thomas^a ; ^{achutomy@gmail.com" class="auth_mail" title="E-mail the corresponding author} ; Ebin M. Manuel^b
• 关键词：cryposystem ; RSA ; ECC ; modular multiplication ; Montgomery multiplication
• 刊名：Procedia Technology
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：24
• 期：Complete
• 页码：911-917
• 全文大小：220 K

文摘

The Elliptic Curve cryptosystem has replaced the prevailing first generation public key algorithms – RSA and Diffie - Hellman due to its shorter key size requirement. This paper presents a modified Elliptic Curve and RSA cryptosystem by incorporating a newly designed Montgomery multiplier algorithm for better efficiency. The inherent disadvantage of delay due to the large number of computations in Elliptic Curve cryptography is improved substantially by the implantation of the modified Montgomery algorithm in it. The simulation results show significant improvement in terms of speed and power.