The following pages link to Better polynomials for GNFS (Q2792346):
Displaying 7 items.
- Non-linear polynomial selection for the number field sieve (Q412202) (← links)
- Montgomery's method of polynomial selection for the number field sieve (Q745185) (← links)
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516) (← links)
- On nonlinear polynomial selection and geometric progression (mod \(N\)) for number field sieve (Q2787639) (← links)
- On polynomial selection for the general number field sieve (Q3420245) (← links)
- A new ranking function for polynomial selection in the number field sieve (Q4998643) (← links)
- Higher-dimensional sieving for the number field sieve algorithms (Q6165871) (← links)
