Highly parallel computations modulo a number having only small prime factors

DOI10.1016/0890-5401(92)90057-MMaRDI QIDQ1184734zbMATH OpenFDO

Authors Thomas Zeugmann

Publication date 28 June 1992

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

Full work available at URL https://doi.org/10.1016/0890-5401(92)90057-M

zbMATH Keywords

discrete rootshighly parallel algorithmsinverselarge powersmall prime factorsuniform families of Boolean circuits

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• Simple parallel algorithms for primality testing and integer factorization
• A practical parallel algorithm for computinga b modc *
• scientific article; zbMATH DE number 1946644
• A fast parallel modular exponentiation algorithm
• Fast parallel modular exponentiation
• scientific article; zbMATH DE number 554529
• scientific article; zbMATH DE number 4165009
• scientific article; zbMATH DE number 708866
• Factoring Numbers on the Massively Parallel Computer

Cites work

• A taxonomy of problems with fast parallel algorithms
• Computing Powers in Parallel
• Hensel and Newton Methods in Valuation Rings
• scientific article; zbMATH DE number 4128395 (Why is no real title available?)
• scientific article; zbMATH DE number 3999284 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3198951 (Why is no real title available?)
• Log Depth Circuits for Division and Related Problems
• Logarithmic Depth Circuits for Algebraic Functions
• On Relating Time and Space to Size and Depth

Cited in

(9)

• Computing Powers in Parallel
• scientific article; zbMATH DE number 1189246 (Why is no real title available?)
• scientific article; zbMATH DE number 18647 (Why is no real title available?)
• scientific article; zbMATH DE number 19771 (Why is no real title available?)
• scientific article; zbMATH DE number 4128395 (Why is no real title available?)
• A practical parallel algorithm for computinga b modc *
• The CREW PRAM Complexity of Modular Inversion
• Factoring Numbers on the Massively Parallel Computer
• Tolerance to asynchrony in algorithms for multiplication and modulo

This page was built for publication: Highly parallel computations modulo a number having only small prime factors

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