Modified radix-2 Montgomery modular multiplication to make it faster and simpler

@article{Manochehri2005ModifiedRM,
  title={Modified radix-2 Montgomery modular multiplication to make it faster and simpler},
  author={Kooroush Manochehri and Saadat Pourmozafari},
  journal={International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II},
  year={2005},
  volume={1},
  pages={598-602 Vol. 1}
}
Montgomery modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem or other cryptosystems based on modular arithmetic. There are several improvements for making it suitable for hardware implementation. Radix-2 version of this algorithm is simple and fast to implement in hardware design. In this paper a new algorithm based on this approach is presented that is more simple and faster than radix-2 algorithm. For implementing this new algorithm, carry save adder… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS
13 Citations
25 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 25 references

A staged carry-save-adder array for Montgomery modular multiplication”, Department of electrical engineering

  • Jhing-Fa Wang, Po-Chuan Lin, Ping-Kun Chiu
  • National cheng kung university,
  • 2000

Tenca , Cetin K . Koc , “ A scalable architecture for Montgomery multiplication

  • F. Alexandre
  • 1999

Similar Papers

Loading similar papers…