Factoring with the quadratic sieve on large vector computers

DOI10.1016/0377-0427(89)90370-1zbMath0684.10005OpenAlexW2096154872MaRDI QIDQ1825224

Herman J. J. te Riele, Walter M. Lioen, Dik T. Winter

Publication date: 1989

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(89)90370-1

zbMATH Keywords

factorizationvector computersquadratic sieveCYBER 205NEX SX-2

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41)

Related Items

Factoring Integers with Large-Prime Variations of the Quadratic Sieve

Cites Work

• Unnamed Item
• Unnamed Item
• Factoring: algorithms, computations, and computers
• A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers
• Factoring integers with elliptic curves
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• Implementation of a new primality test
• The Multiple Polynomial Quadratic Sieve
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Factoring Large Numbers on a Pocket Calculator
• Tables of Fibonacci and Lucas factorizations
• A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
• Improved Techniques for Lower Bounds for Odd Perfect Numbers
• A method for obtaining digital signatures and public-key cryptosystems
• Prime numbers and computer methods for factorization