ASIACRYPT
2003
Springer
14 years 17 days ago
2003
Springer
We present an algorithm that finds polynomials with many roots modulo many primes by rotating candidate Number Field Sieve polynomials using the Chinese Remainder Theorem. We also...