Efficient Modular Arithmetic

DOI10.1017/9781108854207.011MaRDI QIDQ5034410zbMATH OpenOpenAlexFDO

Authors Joppe W. Bos, Thorsten Kleinjung, Dan Page

Publication date 25 February 2022

Full work available at URL https://www.cambridge.org/core/books/computational-cryptography/efficient-modular-arithmetic/1ADDA56747F770FFAB76EF56367C45A9

zbMATH Keywords

Montgomery multiplicationgeneric modular multiplication routines

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60) History of information and communication theory (94-03)

Recommendations

• Fast integer multiplication using modular arithmetic
• A faster modular multiplication algorithm
• scientific article; zbMATH DE number 1294069
• A fast modular multiplication algorithm
• scientific article; zbMATH DE number 1946644
• New modular multiplication algorithms for fast modular exponentiation
• Another look at some fast modular arithmetic methods
• scientific article; zbMATH DE number 4191561
• New iterative algorithms for modular multiplication
• Topics in Cryptology – CT-RSA 2004

Cited in

(6)

• Exploiting Linearity of Modular Multiplication
• Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic
• scientific article; zbMATH DE number 1839433 (Why is no real title available?)
• Another look at some fast modular arithmetic methods
• Fast integer multiplication using modular arithmetic
• Low-Weight Polynomial Form Integers for Efficient Modular Multiplication

This page was built for publication: Efficient Modular Arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034410)