Cryptology ePrint Archive: Report 2021/1151

Efficient Modular Multiplication

Joppe W. Bos and 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.

Category / Keywords: public-key cryptography /

Original Publication (with minor differences): Computational Cryptography edited by Joppe W. Bos and Martijn Stam and published by Cambridge University Press (see www.cambridge.org/9781108795937)

Date: received 10 Sep 2021

Contact author: joppe bos at nxp com

Available format(s): PDF | BibTeX Citation

Version: 20210910:073539 (All versions of this report)

Short URL: ia.cr/2021/1151


[ Cryptology ePrint archive ]