Factoring Integers with Large-Prime Variations of the Quadratic Sieve

DOI10.1080/10586458.1996.10504592zbMATH Open0882.11068OpenAlexW2072798289MaRDI QIDQ4347264FDOQ4347264

Authors: Henk Boender, Herman 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

Recommendations

• Factoring with Two Large Primes
• The Multiple Polynomial Quadratic Sieve
• scientific article; zbMATH DE number 177024

zbMATH Keywords

factorizationcluster of workstationsvector supercomputermultiple polynomial quadratic sieve

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (19)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Factoring with Two Large Primes
• A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
• Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms
• Factoring $$N=p^rq^s$$ for Large r and s
• Factorization of Square-Free Integers with High Bits Known
• Title not available (Why is that?)
• Factoring integers by CVP algorithms
• Aliquot Sequence 3630 Ends After Reaching 100 Digits
• Factorization of the tenth Fermat number
• Smooth numbers and the quadratic sieve
• Title not available (Why is that?)
• Title not available (Why is that?)
• Smooth subsum search a heuristic for practical integer factorization
• Sieving by large prime factors
• Integer factorization as subset-sum problem
• On a strategy in the sieving procedure for the factorization of large natural numbers

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

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