Name
Abstract | ||
|---|---|---|
The first practicalpublic key cryptosystem to be published, the Diffie–Hellmankey exchange algorithm, was based on the assumption that discretelogarithms are hard to compute. This intractability hypothesisis also the foundation for the presumed security of a varietyof other public key schemes. While there have been substantialadvances in discrete log algorithms in the last two decades,in general the discrete log still appears to be hard, especiallyfor some groups, such as those from elliptic curves. Unfortunatelyno proofs of hardness are available in this area, so it is necessaryto rely on experience and intuition in judging what parametersto use for cryptosystems. This paper presents a brief surveyof the current state of the art in discrete logs. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1023/A:1008350005447 | Des. Codes Cryptography |
Keywords | Field | DocType |
discrete logarithms,Diffie–,Hellman key exchange,number field sieve | Discrete mathematics,Elliptic curve Diffie–Hellman,Key exchange,Computer science,Baby-step giant-step,Theoretical computer science,Cryptosystem,Mathematical proof,Public-key cryptography,Diffie–Hellman key exchange,Discrete logarithm | Journal |
Volume | Issue | ISSN |
19 | 2-3 | 1573-7586 |
Citations | PageRank | References |
53 | 7.23 | 40 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrew M. Odlyzko | 1 | 1286 | 413.71 |