Analyzing and comparing Montgomery multiplication algorithms

@article{Ko1996AnalyzingAC,
  title={Analyzing and comparing Montgomery multiplication algorithms},
  author={Çetin Kaya Koç and Tolga Acar and Burton S. Kaliski},
  journal={IEEE Micro},
  year={1996},
  volume={16},
  pages={26-33}
}
This paper discusses several Montgomery multiplication algorithms, two of which have been proposed before. We describe three additional algorithms, and analyze in detail the space and time requirements of all ve methods. These algorithms have been implemented in C and in assembler. The analyses and actual performance results indicate that the Coarsely Integrated Operand Scanning (CIOS) method, detailed in this paper, is the most e cient of all ve algorithms, at least for the general class of… CONTINUE READING
Highly Influential
This paper has highly influenced 49 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 534 citations. REVIEW CITATIONS

Citations

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

534 Citations

02040'97'02'08'14
Citations per Year
Semantic Scholar estimates that this publication has 534 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

New directions in cryptography

  • W. Di e, M. E. Hellman
  • IEEE Transactions on Information Theory,
  • 1976
Highly Influential
7 Excerpts

The Z80180 and big-number arithmetic

  • B. S. Kaliski
  • Dr. Dobb's Journal,
  • 1993
3 Excerpts

Modular multiplication without trial division

  • P. L. Montgomery
  • Mathematics of Computation,
  • 1985
1 Excerpt

Similar Papers

Loading similar papers…