Paper 2017/1057

Montgomery Arithmetic from a Software Perspective

Joppe W. Bos and Peter L. Montgomery

Abstract

This chapter describes Peter L. Montgomery's modular multiplication method and the various improvements to reduce the latency for software implementations on devices which have access to many computational units.

Note: This material has been published as Chapter 2 in Topics in Computational Number Theory Inspired by Peter L. Montgomery edited by Joppe W. Bos and Arjen K. Lenstra and published by Cambridge University Press. See www.cambridge.org/9781107109353.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Book: Topics in Computational Number Theory Inspired by Peter L. Montgomery edited by Joppe W. Bos and Arjen K. Lenstra and published by Cambridge University Press
Contact author(s)
joppe bos @ nxp com
History
2017-10-31: received
Short URL
https://ia.cr/2017/1057
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2017/1057,
      author = {Joppe W.  Bos and Peter L.  Montgomery},
      title = {Montgomery Arithmetic from a Software Perspective},
      howpublished = {Cryptology ePrint Archive, Paper 2017/1057},
      year = {2017},
      note = {\url{https://eprint.iacr.org/2017/1057}},
      url = {https://eprint.iacr.org/2017/1057}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.