Non-linear polynomial selection for the number field sieve
From MaRDI portal
(Redirected from Publication:412202)
Recommendations
- On nonlinear polynomial selection and geometric progression (mod \(N\)) for number field sieve
- Montgomery's method of polynomial selection for the number field sieve
- Better polynomials for GNFS
- Polynomial Selection for the Number Field Sieve
- On polynomial selection for the general number field sieve
- Square Root Algorithms for the Number Field Sieve
- Root optimization of polynomials in the number field sieve
- scientific article; zbMATH DE number 1186938
- scientific article; zbMATH DE number 1113829
- scientific article; zbMATH DE number 1185143
Cites work
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- An Implementation of the Number Field Sieve
- Factoring polynomials with rational coefficients
- Factorization of a 768-Bit RSA Modulus
- LLL: a tool for effective Diophantine approximation
- On polynomial selection for the general number field sieve
- The LLL algorithm. Survey and applications
Cited in
(9)- scientific article; zbMATH DE number 1186938 (Why is no real title available?)
- Root optimization of polynomials in the number field sieve
- Montgomery's method of polynomial selection for the number field sieve
- Better polynomials for GNFS
- On nonlinear polynomial selection and geometric progression (mod \(N\)) for number field sieve
- On the coefficients of the polynomial in the number field sieve
- Selecting polynomials for the function field sieve
- On polynomial selection for the general number field sieve
- Optimality for the two-parameter quadratic sieve
This page was built for publication: Non-linear polynomial selection for the number field sieve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412202)
