An iterative modular multiplication algorithm in RNS

DOI10.1016/j.amc.2005.01.076zbMath1086.94024OpenAlexW2084613857MaRDI QIDQ814756

Chih-Hung Wang, Chin-Chen Chang, Jen-Ho Yang

Publication date: 7 February 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.01.076

zbMATH Keywords

CryptographyResidue number systemModular arithmetic

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Cites Work

• Unnamed Item
• Montgomery multiplication in \(\text{GF}(2^ k)\)
• An iterative modular multiplication algorithm
• Modular Multiplication Without Trial Division
• A Computer Algorithm for Calculating the Product AB Modulo M
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A method for obtaining digital signatures and public-key cryptosystems
• Montgomery reduction with even modulus
• An RNS Montgomery modular multiplication algorithm
• A study of the residue-to-binary converters for the three-moduli sets

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