Modern Computer Algebra
The LLL Algorithm: Survey and Applications
The LLL Algorithm: Survey and Applications
Factorization of a 768-bit RSA modulus
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
| Hi-index | 0.00 |
We present an algorithm to find two non-linear polynomials for the Number Field Sieve integer factorization method. This algorithm extends Montgomery's ''two quadratics'' method; for degree 3, it gives two skewed polynomials with resultant O(N^5^/^4), which improves on the Williams O(N^4^/^3) result (Williams, 2010).