A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)

DOI10.1016/S0020-0190(99)00137-4zbMath1004.94017OpenAlexW1964601020MaRDI QIDQ1606999

Chin-Chen Chang, Chien-Yuan Chen

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00137-4

zbMATH Keywords

RSA cryptosystemsiterative modular multiplication algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (1)

Revisiting sum of residues modular multiplication

Cites Work

• A Computer Algorithm for Calculating the Product AB Modulo M
• A method for obtaining digital signatures and public-key cryptosystems

This page was built for publication: A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)