Name
Abstract | ||
|---|---|---|
. The difficulty in solving the discrete logarithm problem is of extreme cryptographic importance since it is widely used in signature schemes, message encryption, key exchange, authentication and so on ([15], [17], [21], [29] etc.). The General Number Field Sieve (GNFS) is the asymptotically fastest known method to compute discrete logs mod p [18]. With the first implementation of the GNFS for discrete logs by using Schirokauer's improvement [27] we were able to show its practicability [31].... |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1007/3-540-61581-4_70 | ANTS |
Keywords | Field | DocType |
general number field sieve,computing discrete logarithms,discrete logarithm,discrete logarithm problem,encrypted key exchange | Discrete mathematics,Binary logarithm,Combinatorics,XTR,Baby-step giant-step,Special number field sieve,L-notation,Logarithm,General number field sieve,Mathematics,Discrete logarithm | Conference |
Volume | ISSN | ISBN |
1122 | 0302-9743 | 3-540-61581-4 |
Citations | PageRank | References |
15 | 1.59 | 10 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Damian Weber | 1 | 98 | 16.23 |