Corpus ID: 212554101

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}
}
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… Expand
1 Citations

Figures and Tables from this paper

Implementation of Modular Reduction and Modular Multiplication Algorithms
Secure and reliable system has become an important exaction in the modern day offices. With the evolution of office equipment’s from handwritten notes to desktops to digital storage of confidentialExpand

References

SHOWING 1-4 OF 4 REFERENCES
IMPLEMENTATION OF MODULAR EXPONENTIATION USING MONTGOMERY ALGORITHMS
Several algorithms for Public Key Cryptography (PKC), such as RSA, Diffie-Hellman, and Elliptic Curve Cryptography are used for secure communications. These algorithms require modular exponentiationExpand
A High Speed 16*16 Multiplier Based On Urdhva Tiryakbhyam Sutra
TLDR
Propagation delay and dynamic power consumption were calculated and found reduced and the propagation delay in comparison with array based architecture and parallel adder based implementation which are most commonly used architectures are reduced. Expand
Modulo Multiplicative Inverse Circuit Design
    The institute of electronics, communications and Information Technology school of Electrical and electronic Engineering
    • Branko Dokic International Journal of computer applications