Factoring Integers with Large-Prime Variations of the Quadratic Sieve

DOI10.1080/10586458.1996.10504592zbMath0882.11068OpenAlexW2072798289MaRDI QIDQ4347264

Henk Boender, Herman J. J. te Riele

Publication date: 17 February 1998

Published in: Experimental Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

factorizationcluster of workstationsvector supercomputermultiple polynomial quadratic sieve

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Factorization; primality (11A51) Factorization (11Y05) Sieves (11N35)

Related Items (2)

Aliquot Sequence 3630 Ends After Reaching 100 Digits ⋮ Factorization of the tenth Fermat number

Cites Work

• Unnamed Item
• The development of the number field sieve
• A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers
• Factoring with the quadratic sieve on large vector computers
• A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
• On factoring large numbers
• An algorithm for finding a fundamental set of cycles of a graph
• Prime numbers and computer methods for factorization

This page was built for publication: Factoring Integers with Large-Prime Variations of the Quadratic Sieve