Cited in
(19)- A Kilobit Hidden SNFS Discrete Logarithm Computation
- Root optimization of polynomials in the number field sieve
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
- Montgomery's method of polynomial selection for the number field sieve
- Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants
- A new ranking function for polynomial selection in the number field sieve
- The Gauss-Wilson theorem for quarter-intervals
- Sparse Gaussian Elimination Modulo p: An Update
- Lattice sieving in three dimensions for discrete log in medium characteristic
- GMP-ECM
- CFRAC
- RECIP
- LibTom
- Msieve
- A role for generalized Fermat numbers
- The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic
- Better polynomials for GNFS
- Examples of CM curves of genus two defined over the reflex field
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
This page was built for software: CADO-NFS
