BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Churchill CompSci Talks
SUMMARY:Lenstra's elliptic curve factorization method - Le
o Lai\, Churchill College
DTSTART;TZID=Europe/London:20160127T193000
DTEND;TZID=Europe/London:20160127T201500
UID:TALK63165AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/63165
DESCRIPTION:Integer factorization is an important problem in c
omputational number theory with many applications
in cryptography. Elliptic curves\, on the other ha
nds\, are mathematical objects whose study predate
s the notion of computation by more than a century
. In 1987\, Lenstra described a new factoring algo
rithm using elliptic curves\, which is still one o
f the fastest special purpose factorization algori
thms invented so far. Conversely\, the desire to r
igorously analyze this algorithm has produced new
results in number theory. This talk will describe
his algorithm. No knowledge beyond basic number th
eory is required.
LOCATION:Wolfson Hall\, Churchill College
CONTACT:Matthew Ireland
END:VEVENT
END:VCALENDAR