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