Implementation of Montgomery Modular Multiplication Using High Speed Multiplier

@inproceedings{Yete2017ImplementationOM,
  title={Implementation of Montgomery Modular Multiplication Using High Speed Multiplier},
  author={Ankush Yete and Ananya Kajava and Hazel Melita Rodrigues and Kiran Kumar},
  year={2017}
}
  • Ankush Yete, Ananya Kajava, +1 author Kiran Kumar
  • Published 2017
Many algorithms for Public Key Cryptography, such as RSA, Elliptic Curve Cryptography and Diffie-Hellman are used for secure communication. These algorithms mainly use modular exponentiation as their basic operation. Modular exponentiation involves modular multiplication to be done repeatedly which is very costly for computations as there are large operands used. Therefore, time taken for computing is very large. Therefore, this computation time can be reduced immensely by Montgomery… CONTINUE READING