BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d3ef0e9a299
DTSTART;TZID=America/Toronto:20210129T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210129T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-michael-naehrig-0
SUMMARY:Tutte Colloquium - Michael Naehrig
CLASS:PUBLIC
DESCRIPTION:TITLE: Finding twin smooth integers for isogeny-based cryptogr
 aphy\n\nSpeaker:\n Michael Naehrig\n\nAffliation:\n Microsoft Research\n\n
 Zoom:\n Please email Emma Watson\n\nABSTRACT:\n\nEfficient and secure ins
 tantiations of cryptographic protocols require\ncareful parameter selectio
 n. For the isogeny-based cryptographic\nprotocol B-SIDH\, a variant of the
  Supersingular-Isogeny Diffie Hellman\n(SIDH) key exchange\, one needs to 
 find two consecutive B-smooth\nintegers of cryptographic size such that th
 eir sum is prime. The\nsmaller the smoothness bound B is\, the more effici
 ent the protocol\nbecomes. This talk discusses a sieving algorithm to find
  such twin\nsmooth integers that uses solutions to the Prouhet-Tarry-Escot
 t\nproblem.
DTSTAMP:20260406T173614Z
END:VEVENT
END:VCALENDAR