BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Point counting on elliptic curves
DTSTART:20160728T100000
DTEND:20160728T120000
DTSTAMP:20260407T011317Z
UID:69551179edaf1d8b75af6f7cd8846445dfbaf31c82e06f8adeeb2ab7
CATEGORIES:Conferences - Seminars
DESCRIPTION:Dusan Kostic\nEDIC Candidacy Exam\nExam President: Prof. Ola S
 vensson\nThesis Director: Prof. Arjen Lenstra\nCo-examiner: Prof. Dimitar 
 Jetchev\nBackground papersCounting points on elliptic curves over finite f
 ields\, (1995)\, by R. Schoof.Computing modular polynomials\, (2004)\, by 
 D. Charles\, K. Lauter.Efficient ephemeral elliptic curve cryptographic ke
 ys\, (2015)\, by A. Miele\, A.K. Lenstra.Abstract\nGenerating secure ellip
 tic curves is an essential part in elliptic curve cryptographic systems. N
 umber of points on the curve plays an important role in the assessment of 
 the curve security. This write-up investigates the most efficient algorith
 m for general point counting - Schoof-Elkies-Atkin algorithm\, a method fo
 r constructing modular polynomials\, and a complex multiplication based me
 thod for generating elliptic curves. Research directions in the area of cu
 rve generation are then discussed.
LOCATION:BC 329 https://plan.epfl.ch/?room==BC%20329
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR