Another look at some fast modular arithmetic methods

DOI10.1515/JMC.2009.008MaRDI QIDQ3182463zbMATH OpenFDO

Authors M. Jason Hinek, Charles C. Y. Lam

Publication date 9 October 2009

Published in Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/JMC.2009.008

zbMATH Keywords

modular exponentiationfast modular arithmetic

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 1294069
• A faster modular multiplication algorithm
• A fast modular multiplication algorithm
• New modular multiplication algorithms for fast modular exponentiation
• scientific article; zbMATH DE number 4191561
• Efficient Modular Arithmetic
• Fast integer multiplication using modular arithmetic
• A generalisation of Brickell's algorithm for fast modular multiplication
• New iterative algorithms for modular multiplication
• Fast algorithms for implemention of Montgomery's modular multiplication technique

Cites work

• A method for obtaining digital signatures and public-key cryptosystems

Cited in

(4)

• Should one always use repeated squaring for modular exponentiation?
• Efficient Modular Arithmetic
• A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli
• Modular Multiplication Without Trial Division

This page was built for publication: Another look at some fast modular arithmetic methods

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