Welcome to the resource topic for 2021/1151
Title:
Efficient Modular Multiplication
Authors: Joppe W. Bos, Thorsten Kleinjung, 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.
ePrint: https://eprint.iacr.org/2021/1151
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .