Factoring Numbers on the Massively Parallel Computer

DOI10.1007/978-1-4684-4730-9_8MaRDI QIDQ5019321zbMATH OpenOpenAlexFDO

Authors Marvin Wunderlich

Publication date 8 January 2022

Published in Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4684-4730-9_8

Mathematics Subject Classification ID

Factorization (11Y05) Parallel algorithms in computer science (68W10) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 554529
• scientific article; zbMATH DE number 4165009
• scientific article; zbMATH DE number 708866
• Implementing the Continued Fraction Factoring Algorithm on Parallel Machines
• scientific article; zbMATH DE number 862681
• scientific article; zbMATH DE number 4045819
• scientific article; zbMATH DE number 1424533
• Factoring on a computer
• Highly parallel computations modulo a number having only small prime factors
• scientific article; zbMATH DE number 503338

Cites work

• A Method of Factoring and the Factorization of F 7
• Analysis of a simple factorization algorithm
• scientific article; zbMATH DE number 3885978 (Why is no real title available?)

Cited in

(4)

• Highly parallel computations modulo a number having only small prime factors
• Implementing the Continued Fraction Factoring Algorithm on Parallel Machines
• On the Parallel Generation of the Residues for the Continued Fraction Factoring Algorithm
• A parallel version of the continued fraction integer factoring algorithm

This page was built for publication: Factoring Numbers on the Massively Parallel Computer

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