BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Point counting on elliptic curves
DTSTART:20161107T100000
DTEND:20161107T120000
DTSTAMP:20260408T055758Z
UID:f6b7ba446b10016d130294e7846158451ad0ba54bcad25a235e99229
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  \n\nBackground papers\nCounting points on elliptic curves over f
 inite fields\, (1995)\, by R. Schoof.\nComputing modular polynomials\, (20
 04)\, by D. Charles\, K. Lauter.\nEfficient ephemeral elliptic curve crypt
 ographic keys\, (2015)\, by A. Miele\, A.K. Lenstra.\n\nAbstract\nGenerati
 ng secure elliptic curves is an essential part in elliptic curve cryptogra
 phic systems. Number of points on the curve plays an important role in the
  assessment of the curve security. This write-up investigates the most eff
 icient algorithm for general point counting - Schoof-Elkies-Atkin algorith
 m\, a method for constructing modular polynomials\, and a complex multipli
 cation based method for generating elliptic curves. Re- search directions 
 in the area of curve generation are then discussed.
LOCATION:BC 329 https://plan.epfl.ch/?room==BC%20329
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR