Event Detail

Event Type: 
Department Colloquium
Tuesday, February 21, 2006 - 07:00
Dearborn 118

Speaker Info

UCSD & Universiteit Leiden

In the last two decades, elliptic curves over finite fields have been used in cryptography, factoring and primality testing. In this context, one naturally wonders how hard it is to produce such a curve with a given number of points. Despite our inability to prove actual theorems showing that this is possible at all, I will present a simple, but amazingly efficient construction that can be used in cryptography, for colloquium talks and at birthday parties.