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:6832caf34dc7f
DTSTART;TZID=America/Toronto:20210129T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210129T153000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-michael-naehrig-0
SUMMARY:Tutte Colloquium - Michael Naehrig
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Finding twin smooth integers for isogeny-ba
 sed cryptography\n\nSpeaker:\n Michael Naehrig\n\nAffliation:\n Microsoft 
 Research\n\nZoom:\n Please email Emma Watson\n\nABSTRACT:\n\nEfficient an
 d secure instantiations of cryptographic protocols require\ncareful parame
 ter selection. For the isogeny-based cryptographic\nprotocol B-SIDH\, a va
 riant of the Supersingular-Isogeny Diffie Hellman\n(SIDH) key exchange\, o
 ne needs to find two consecutive B-smooth\nintegers of cryptographic size 
 such that their sum is prime. The\nsmaller the smoothness bound B is\, the
  more efficient the protocol\nbecomes. This talk discusses a sieving algor
 ithm to find such twin\nsmooth integers that uses solutions to the Prouhet
 -Tarry-Escott\nproblem.\n 
DTSTAMP:20250525T074659Z
END:VEVENT
END:VCALENDAR