An RNS Montgomery modular multiplication algorithm

DOI10.1109/12.709376MaRDI QIDQ4571471zbMATH OpenOpenAlexFDO

Authors Jean-Claude Bajard, Laurent-Stéphane Didier, Peter Kornerup

Publication date 9 July 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.709376

Mathematics Subject Classification ID

Cryptography (94A60) Numerical algorithms for computer arithmetic, etc. (65Y04)

Cited in

(10)

• A low-complexity combinatorial RNS multiplier
• scientific article; zbMATH DE number 1882024 (Why is no real title available?)
• Digit-serial-in-serial-out systolic multiplier for Montgomery algorithm
• scientific article; zbMATH DE number 2230910 (Why is no real title available?)
• Finite field arithmetic in large characteristic for classical and post-quantum cryptography
• How to fake an RSA signature by encoding modular root finding as a SAT problem
• Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
• Dynamical directions in numeration
• An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS
• An iterative modular multiplication algorithm in RNS

This page was built for publication: An RNS Montgomery modular multiplication algorithm

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