BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Lenstra's elliptic curve factorization method - Leo Lai\, Churchil
 l College
DTSTART:20160127T193000Z
DTEND:20160127T201500Z
UID:TALK63165@talks.cam.ac.uk
CONTACT:Matthew Ireland
DESCRIPTION:Integer factorization is an important problem in computational
  number theory with many applications in cryptography. Elliptic curves\, o
 n the other hands\, are mathematical objects whose study predates the noti
 on of computation by more than a century. In 1987\, Lenstra described a ne
 w factoring algorithm using elliptic curves\, which is still one of the fa
 stest special purpose factorization algorithms invented so far. Conversely
 \, the desire to rigorously analyze this algorithm has produced new result
 s in number theory. This talk will describe his algorithm. No knowledge be
 yond basic number theory is required.
LOCATION:Wolfson Hall\, Churchill College
END:VEVENT
END:VCALENDAR