Montgomery reduction with even modulus

DOI10.1049/IP-CDT:19941291MaRDI QIDQ4322313zbMATH OpenOpenAlexFDO

Authors Çetin Kaya Koç

Publication date 9 February 1995

Published in IEE Proceedings - Computers and Digital Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/ip-cdt:19941291

zbMATH Keywords

Chinese remainder theoremmodular exponentiationmodular multiplicationMontgomery's algorithm

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• A faster modular multiplication algorithm
• Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
• New frameworks for Montgomery’s modular multiplication method
• scientific article; zbMATH DE number 1456815
• Fast direct computation of modular reduction

Cited in

(3)

• Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications
• Efficient algorithms for remainder computation and exponentiation of long numbers
• An iterative modular multiplication algorithm in RNS

This page was built for publication: Montgomery reduction with even modulus

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