scholarly journals RSA Public Key Cryptosystem using Modular Multiplication

2013 ◽  
Vol 80 (5) ◽  
pp. 38-42
Author(s):  
G. A.V.RamaChandraRao ◽  
P. V. Lakshmi ◽  
N. Ravi Shankar
2013 ◽  
Vol 433-435 ◽  
pp. 499-502
Author(s):  
Lian Qing Zhao ◽  
Shu Li ◽  
Yuan Xun Chen ◽  
Dong Jun Liu

Modular exponentiation of large number is widely applied in public-key cryptosystem, also the bottleneck in the computation of public-key algorithm. Modular multiplication is the key calculation in modular exponentiation. An improved Montgomery algorithm is utilized to achieve modular multiplication and converted into systolic array to increase the running frequency. A high efficiency fast modular exponentiation structure is developed on FPGA to bring the best out of the modular multiplication module and enhance the ability of defending timing attacks and power attacks. For 1024 bit key operands, the design can be run at 170MHz.


Author(s):  
Yasuhiko IKEMATSU ◽  
Dung Hoang DUONG ◽  
Albrecht PETZOLDT ◽  
Tsuyoshi TAKAGI

2021 ◽  
Vol 1897 (1) ◽  
pp. 012045
Author(s):  
Karrar Taher R. Aljamaly ◽  
Ruma Kareem K. Ajeena

2009 ◽  
Vol 3 (4) ◽  
Author(s):  
Simon R. Blackburn ◽  
Carlos Cid ◽  
Ciaran Mullan

Sign in / Sign up

Export Citation Format

Share Document