1296 search results - page 2 / 260 » The Number Field Sieve |
ASIACRYPT
2003
Springer
13 years 11 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 ...
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 16 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 9 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...