23 search results - page 2 / 5 » A Kilobit Special Number Field Sieve Factorization |
STOC
1990
ACM
13 years 9 months ago
1990
ACM
The number field sieve is an algorithm to factor integers of the form re
ITCC
2005
IEEE
13 years 11 months ago
2005
IEEE
Recently, efficient custom-hardware designs were proposed for the linear algebra step of the Number Field Sieve integer factoring algorithm. These designs make use of a heuristic ...
MOC
2010
13 years 17 days 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
1992
Springer
13 years 10 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...
EUROCRYPT
2007
Springer
13 years 12 months ago
2007
Springer
Significant progress in the design of special purpose hardware for supporting the Number Field Sieve (NFS) has been made. From a practical cryptanalytic point of view, however, no...