16 search results - page 1 / 4 » The Number Field Sieve in the Medium Prime Case |
CRYPTO
2006
Springer
14 years 2 months ago
2006
Springer
EUROCRYPT
2006
Springer
14 years 2 months ago
2006
Springer
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
MOC
2010
13 years 5 months ago
2010
We define the weight of an integer N to be the smallest w such that N can be represented as w i=1 i2ci , with 1,..., w{1,-1}. Since arithmetic modulo a prime of low weight is parti...
ASIACRYPT
2003
Springer
14 years 4 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...
CRYPTO
1992
Springer
14 years 3 months ago
1992
Springer
Using a number field sieve, discrete logarithms modulo primes of special forms can be found faster than standard primes. This has raised concerns about trapdoors in discrete log cr...