10 search results - page 1 / 2 » On Quadratic Polynomials for the Number Field Sieve |
CATS
1998
13 years 6 months ago
1998
ASIACRYPT
2003
Springer
13 years 10 months 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...
ASIACRYPT
2003
Springer
13 years 10 months ago
2003
Springer
The best practical algorithm for class group computations in imaginary quadratic number fields (such as group structure, class number, discrete logarithm computations) is a varian...
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
We describe an enhanced version of the TWINKLE factoring device and analyse to what extent it can be expected to speed up the sieving step of the Quadratic Sieve and Number Field S...
JC
2000
13 years 4 months ago
2000
This paper provides verification procedures for a number of decision problems in quadratic function fields of odd characteristic, thereby establishing membership of these problems...