1380 search results - page 1 / 276 » A General Polynomial Sieve |
DCC
1999
IEEE
13 years 4 months ago
1999
IEEE
An important component of the index calculus methods for finding discrete logarithms is the acquisition of smooth polynomial relations. Gordon and McCurley (1992) developed a sieve...
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...
DM
2010
13 years 4 months ago
2010
We resolve affirmatively some conjectures of Reiner, Stanton, and White [6] regarding enumeration of various classes of matrices which are invariant under certain cyclic row and co...
CATS
1998
13 years 6 months ago
1998
SACRYPT
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We use the specific structure of the inputs to the cofactorization step in the general number field sieve (GNFS) in order to optimize the runtime for the cofactorizatio...