23 search results - page 1 / 5 » A Kilobit Special Number Field Sieve Factorization |
ASIACRYPT
2007
Springer
13 years 9 months ago
2007
Springer
We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number having more than 1024 bits, namely the Mersenne nu...
CHES
2007
Springer
13 years 11 months ago
2007
Springer
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
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...
MOC
2000
13 years 5 months ago
2000
We describe an adaptation of the number field sieve to the problem of computing logarithms in a finite field. We conjecture that the running time of the algorithm, when restricted ...
EUROCRYPT
2000
Springer
13 years 9 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...