Non-linear polynomial selection for the number field sieve
From MaRDI portal
Publication:412202
DOI10.1016/J.JSC.2011.09.004zbMATH Open1278.11107OpenAlexW2022432349MaRDI QIDQ412202FDOQ412202
Publication date: 4 May 2012
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2011.09.004
Cites Work
- Title not available (Why is that?)
- Factoring polynomials with rational coefficients
- On polynomial selection for the general number field sieve
- Factorization of a 768-Bit RSA Modulus
- The LLL algorithm. Survey and applications
- An Implementation of the Number Field Sieve
- LLL: A Tool for Effective Diophantine Approximation
Cited In (5)
- Montgomery's method of polynomial selection for the number field sieve
- Selecting polynomials for the Function Field Sieve
- On nonlinear polynomial selection and geometric progression (mod \(N\)) for number field sieve
- On the coefficients of the polynomial in the number field sieve
- On polynomial selection for the general number field sieve
Recommendations
- Square Root Algorithms for the Number Field Sieve 👍 👎
- On polynomial selection for the general number field sieve 👍 👎
- On nonlinear polynomial selection and geometric progression (mod \(N\)) for number field sieve 👍 👎
- Better polynomials for GNFS 👍 👎
- Root optimization of polynomials in the number field sieve 👍 👎
- Polynomial Selection for the Number Field Sieve 👍 👎
- Montgomery's method of polynomial selection for the number field sieve 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
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)
