A new modulo computation algorithm

DOI10.1051/RO/1990240303071MaRDI QIDQ4712128zbMATH OpenOpenAlexFDO

Authors David Naccache de Paz, Abdelhalim M'silti

Publication date 25 June 1992

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/104989

zbMATH Keywords

algorithmregistermodulointeger-divisionright-shifts

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Recommendations

• Modular Multiplication Without Trial Division
• scientific article; zbMATH DE number 3961705
• Fast direct computation of modular reduction
• A faster modular multiplication algorithm

Cited in

(3)

• Small universal one-state linear operator algorithm
• The iterated mod problem
• Modular Multiplication Without Trial Division

This page was built for publication: A new modulo computation algorithm

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