Comparison of three modular reduction functions

DOI10.1007/3-540-48329-2_16MaRDI QIDQ4341745zbMATH OpenFDO

Authors Antoon Bosselaers, René Govaerts, Joos Vandewalle

Publication date 6 October 1997

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

Full work available at URL https://doi.org/10.1007/3-540-48329-2_16

zbMATH Keywords

Barrett's algorithmmodular exponentiationmodular reduction algorithmsMontgomery's algorithm

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• New modular multiplication algorithms for fast modular exponentiation
• A faster modular multiplication algorithm
• An algorithm for modular exponentiation.
• A fast modular multiplication algorithm

Cited in

(13)

• Efficient algorithms for remainder computation and exponentiation of long numbers
• Fast direct computation of modular reduction
• Testing the speed of algorithms and programs implementing the basic operations of asymmetric cryptography
• Double-speed Barrett moduli
• Multiplication on large simple modules based on Barrett's minimally redundant modular scheme
• An improvement of the Barrett modular reduction algorithm
• Linear systolic multiplier/squarer for fast exponentiation
• Efficient and formally proven reduction of large integers by small moduli
• Parallel modular exponentiation using load balancing without precomputation
• scientific article; zbMATH DE number 2104055 (Why is no real title available?)
• Enhanced digital signature using RNS digit exponent representation
• Revisiting sum of residues modular multiplication
• Finite field arithmetic in large characteristic for classical and post-quantum cryptography

This page was built for publication: Comparison of three modular reduction functions

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