A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
From MaRDI portal
Publication:3786516
DOI10.1137/0217023zbMath0644.10002OpenAlexW2161964967MaRDI QIDQ3786516
No author found.
Publication date: 1988
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d4101acb6c27fcfd307d6154e71f59aab7ee6192
Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41) Theory of software (68N99)
Related Items (6)
Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes ⋮ Some uses of microcomputers in number theory research ⋮ Factoring Integers with Large-Prime Variations of the Quadratic Sieve ⋮ Quadratic sieving ⋮ Algorithm for factoring some RSA and Rabin moduli ⋮ Factoring with the quadratic sieve on large vector computers
This page was built for publication: A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm