Name
Abstract | ||
|---|---|---|
At present, there are two competing index calculus variants for computing discrete logarithms in (Z/pZ)* in practice. The purpose of this paper is to summarize the recent practical experience with a generalized implementation covering both a variant of the Number Field Sieve and the Gaussian integer method. By this implementation we set a record with p consisting of 85 decimal digits. With regard to computational results, including the running time, we provide a comparison of the two methods for this value of p. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/BFb0054125 | ADVANCES IN CRYPTOLOGY - EUROCRYPT '98 |
Keywords | Field | DocType |
discrete logarithms,number field sieve,index calculus | Gaussian integer,Discrete mathematics,Cryptography,Quadratic equation,Theoretical computer science,Logarithm,Public-key cryptography,General number field sieve,Decimal,Mathematics,Distributed computing | Conference |
Volume | ISSN | Citations |
1403 | 0302-9743 | 6 |
PageRank | References | Authors |
0.90 | 9 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Damian Weber | 1 | 98 | 16.23 |