Factorization Using the Quadratic Sieve Algorithm

DOI10.1007/978-1-4684-4730-9_9zbMath1486.94094OpenAlexW1572813692MaRDI QIDQ5019322

James A. Davis, D. B. Holdridge

Publication date: 8 January 2022

Published in: Advances in Cryptology (Search for Journal in Brave)

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

zbMATH Keywords

Gaussian eliminationquadratic residuesingle precisionprime base

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Related Items (2)

Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms ⋮ Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• A Method of Factoring and the Factorization of F 7

This page was built for publication: Factorization Using the Quadratic Sieve Algorithm