|
2292
|
New Directions in Cryptography
– Whitfield Diffie, Martin E. Hellman
- 1976
|
|
61
|
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
– Ueli M. Maurer
- 1994
|
|
69
|
Algorithms for black box fields and their application to cryptography
– D Boneh, R Lipton
- 1996
|
|
2507
|
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems
– R.L. Rivest, A. Shamir, L. Adleman
- 1978
|
|
256
|
An improved algorithm for computing logarithms over GF (p) and its cryptographic significance
– S Pohlig, M Hellman
- 1978
|
|
961
|
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithm
– T ElGamal
- 1985
|
|
184
|
Lower Bounds for Discrete Logarithms and Related Problems
– Victor Shoup
- 1997
|
|
30
|
Diffie-Hellman Oracles
– Ueli M. Maurer, Stefan Wolf
- 1996
|
|
23
|
The Diffie-Hellman Protocol
– Ueli M. Maurer, Stefan Wolf
- 1999
|
|
262
|
Elliptic Curve Public Key Cryptosystems
– Alfred Menezes
- 1993
|
|
38
|
bounds for discrete logarithms and related problems
– Lower
- 1997
|
|
136
|
Advance in elliptic curve cryptography
– I F Blake, G Seroussi, N P Smart
- 2005
|
|
23
|
A note on elliptic curves over finite fields
– H-G Rück
- 1987
|
|
154
|
Elliptic curves over finite fields and the computation of square roots mod p
– René Schoof
- 1985
|
|
24
|
Diffie-Hellman is as strong as discrete log for certain primes
– B den Boer
- 1990
|
|
169
|
Hans-Georg Rück, A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves
– Gerhard Frey
- 1994
|
|
460
|
Short signatures from the Weil pairing
– Dan Boneh, Ben Lynn, Hovav Shacham
- 2001
|
|
121
|
Number-theoretic constructions of efficient pseudo-random functions
– Moni Naor, Omer Reingold
- 1997
|
|
48
|
Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA
– ANSI X9 62
- 1999
|
