Multiple product modulo arbitrary numbers

DOI10.1006/INCO.1996.0093MaRDI QIDQ5894636zbMATH OpenOpenAlexFDO

Authors Claudia Bertram-Kretzberg, Thomas Hofmeister

Publication date 12 November 1997

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1996.0093

zbMATH Keywords

threshold circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Multiple product modulo arbitrary numbers
• Product of integers in an interval, modulo squares
• An Algorithm for Multiplication in Modular Arithmetic
• Products of factorials modulo p
• A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)
• Rapid multiplication modulo the sum and difference of highly composite numbers
• An iterative modular multiplication algorithm
• Fast integer multiplication using modular arithmetic
• Modular Multiplication Without Trial Division

Cited in

(1)

• Multiple product modulo arbitrary numbers

This page was built for publication: Multiple product modulo arbitrary numbers

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