ECC '99 (slides from talks)
3rd workshop on Elliptic Curve Cryptography (ECC '99)
(November 1-3, 1999)
Slides from some of the ECC '99 talks (postscript files):
- Michele Abdalla
DHIES: An encryption scheme based on the Diffie-Hellman
- Mihir Bellare
Practice-oriented provable-security: How to protect
yourself against un-anticipated attacks
Mihir has an introductory paper on practice-oriented
his web page.
- Simon Blake-Wilson
Key establishment protocls and the Diffie-Hellman problem
- Steven Galbraith
Some open problems relating to the elliptic
curve discrete logarithm problem (ECDLP)
- Robert Gallant
Faster elliptic curve cryptography using efficient
- Philippe Golle
Authenticating streamed data in the presence of random
- Dan Gordon
Fast exponentiation methods.
- Arjen Lenstra
Selecting cryptographic key sizes
Full paper: Word (325k).
- Reynald Lercier
State-of-the art in implementing algorithms for the
(ordinary) discrete logarithm problem.
- Michele Mosca
Capabilities and limitations of quantum computers.
- Christof Paar
Implementation options for finite field arithmetic
for elliptic curve cryptosystems.
Compressed Postscript (366k)
- Jerome A. Solinas
Efficient implementation of Koblitz curves and
generalized Mersenne arithmetic.
- Andreas Stein
Recent developments in hyperelliptic curve cryptography
- Jacques Stern
Secure design of discrete log signature schemes
- Edlyn Teske
The parallelized kangaroo method
- Stefan Wolf
How secure is the Diffie-Hellman protocol?
The slides are unavailable (they were handwritten). Related
papers can be found