An Algorithm for Multiplication in Modular Arithmetic

DOI10.2307/2690208MaRDI QIDQ3739192zbMATH OpenOpenAlexFDO

Authors Walter E. Gross, Peter Hilton, Jean Pedersen, Kim Yew Yap

Publication date 1986

Full work available at URL https://doi.org/10.2307/2690208

zbMATH Keywords

algorithmmultiplicationmodular arithmetic

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Radix representation; digital problems (11A63) Arithmetic theory of polynomial rings over finite fields (11T55)

Recommendations

• Modular Multiplication Without Trial Division
• scientific article; zbMATH DE number 62666
• scientific article; zbMATH DE number 2104055
• scientific article; zbMATH DE number 3961705
• A faster modular multiplication algorithm

Cited in

(9)

• Exploiting Linearity of Modular Multiplication
• A generalisation of Brickell's algorithm for fast modular multiplication
• An efficient modulo p multiplication algorithm with moderate factors of p+1 and p-1
• Multiple product modulo arbitrary numbers
• Multiple product modulo arbitrary numbers
• scientific article; zbMATH DE number 5708383 (Why is no real title available?)
• Algorithms for the Multiplication Table Problem
• An iterative modular multiplication algorithm in RNS
• Backtracking-assisted multiplication

This page was built for publication: An Algorithm for Multiplication in Modular Arithmetic

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