Quadratic sieving
From MaRDI portal
Publication:2796022
DOI10.1090/mcom/3058zbMath1362.11108OpenAlexW4240112385MaRDI QIDQ2796022
Publication date: 23 March 2016
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/mcom/3058
Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Factorization (11Y05)
Related Items (4)
Impact of Group Theory in Cryptosystem ⋮ A proof of the conjectured run time of the Hafner-McCurley class group algorithm ⋮ I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups ⋮ DeCSIDH: delegating isogeny computations in the CSIDH setting
Cites Work
- Improvements in the computation of ideal class groups of imaginary quadratic number fields
- The development of the number field sieve
- On a problem of Oppenheim concerning Factorisatio Numerorum
- Factoring integers with elliptic curves
- Explicit Bounds for Primality Testing and Related Problems
- The Multiple Polynomial Quadratic Sieve
- A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
- Applying sieving to the computation of quadratic class groups
- Small generators of the ideal class group
- Unnamed Item
- Unnamed Item
This page was built for publication: Quadratic sieving
