An RNS Montgomery modular multiplication algorithm

DOI10.1109/12.709376zbMath1391.94727OpenAlexW2563139900MaRDI QIDQ4571471

Laurent-Stéphane Didier, Jean-Claude Bajard, 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)

Related Items (5)

Dynamical directions in numeration ⋮ Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation ⋮ 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 ⋮ An iterative modular multiplication algorithm in RNS

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