The following pages link to CADO-NFS (Q19299):
Displaying 14 items.
- Montgomery's method of polynomial selection for the number field sieve (Q745185) (← links)
- The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic (Q1671640) (← links)
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms (Q1737153) (← links)
- Lattice sieving in three dimensions for discrete log in medium characteristic (Q2033517) (← links)
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516) (← links)
- The Gauss-Wilson theorem for quarter-intervals (Q2439822) (← links)
- Better polynomials for GNFS (Q2792346) (← links)
- Sparse Gaussian Elimination Modulo p: An Update (Q2829994) (← links)
- Examples of CM curves of genus two defined over the reflex field (Q2942130) (← links)
- A role for generalized Fermat numbers (Q2953213) (← links)
- A new ranking function for polynomial selection in the number field sieve (Q4998643) (← links)
- Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants (Q5121112) (← links)
- Root optimization of polynomials in the number field sieve (Q5264135) (← links)
- A Kilobit Hidden SNFS Discrete Logarithm Computation (Q5738878) (← links)