Discrete logarithms, elliptic curves and cryptography
Starts 15 Nov 2012 15:00
Ends 15 Nov 2012 20:00
Central European Time
Leonardo da Vinci Building Luigi Stasi Seminar Room
Strada Costiera, 11
I - 34151 Trieste (Italy)
This is an introductory talk aimed at the non-expert.
Index calculus provides a relatively efficient method to compute discrete logarithms modulo a prime number $p$. This affects the security of the Diffie-Hellman key-exchange algorithm. The non-existence of an analogue of the index calculus algorithm for elliptic curves gives rise to elliptic curve cryptography.