Paper 2021/1151
Efficient Modular Multiplication
Joppe W. Bos, Thorsten Kleinjung, and Dan Page
Abstract
This paper is concerned with one of the fundamental building blocks used in modern public-key cryptography: modular multiplication. Speed-ups applied to the modular multiplication algorithm or implementation directly translate in a faster modular exponentiation for RSA or a faster realization of the group law when using elliptic curve cryptography.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Minor revision. Computational Cryptography edited by Joppe W. Bos and Martijn Stam and published by Cambridge University Press (see www.cambridge.org/9781108795937)
- Contact author(s)
- joppe bos @ nxp com
- History
- 2021-09-10: received
- Short URL
- https://ia.cr/2021/1151
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/1151,
author = {Joppe W. Bos and Thorsten Kleinjung and Dan Page},
title = {Efficient Modular Multiplication},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/1151},
year = {2021},
url = {https://eprint.iacr.org/2021/1151}
}