20 search results - page 3 / 4 » The Tower Number Field Sieve |
MOC
2010
13 years 4 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...
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
CATS
1998
13 years 11 months ago
1998
CRYPTO
1992
Springer
14 years 1 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...
SACRYPT
2009
Springer
14 years 4 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...