Faster modular multiplication by operand scaling

DOI10.1007/3-540-46766-1_26MaRDI QIDQ4035728zbMATH OpenFDO

Authors Colin D. Walter

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46766-1_26

Mathematics Subject Classification ID

Cryptography (94A60)

Cited in

(5)

• Analysis of the variable length nonzero window method for exponentiation
• Modular multiplication using the core function in the residue number system
• Generalised Mersenne numbers revisited
• Revisiting sum of residues modular multiplication
• RSA Moduli with a Predetermined Portion: Techniques and Applications

This page was built for publication: Faster modular multiplication by operand scaling

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