Speaker: 

Peter Stevenhagen

Institution: 

Universiteit Leiden and UCSD

Time: 

Thursday, June 1, 2006 - 3:00pm

Location: 

MSTB 254

I will explain how to produce, for any given number N, an elliptic curve over a finite field having exactly N points. If N is prime, the heuristic run time is polynomial in log(N).