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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:686c104d1c4a2
DTSTART;TZID=America/Toronto:20241025T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20241025T163000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-subhadip-singha
SUMMARY:Tutte colloquium-Subhadip Singha
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Concrete analysis of a few aspects of lattic
 e-based\ncryptography\n\nSPEAKER:\n Subhadip Singha\n\nAFFILIATION:\n Univ
 ersity of À¶Ý®ÊÓƵ\n\nLOCATION:\n MC 5501\n\nABSTRACT: A seminal 2013 pape
 r by Lyubashevsky\, Peikert\, and Regev\nproposed using ideal lattices as 
 a foundation for post-quantum\ncryptography\, supported by a polynomial-ti
 me security reduction from\nthe approximate Shortest Independent Vectors P
 roblem (SIVP) to the\nDecision Learning With Errors (DLWE) problem in idea
 l lattices. In our\nconcrete analysis of this multi-step reduction\, we fi
 nd that the\nreduction’s tightness gap is so significant that it undermi
 nes any\nmeaningful security guarantees. Additionally\, we have concerns a
 bout\nthe feasibility of the quantum aspect of the reduction in the near\n
 future. Moreover\, when making the reduction concrete\, the\napproximation
  factor for the SIVP problem turns out to be much larger\nthan anticipated
 \, suggesting that the approximate SIVP problem may not\nbe hard for the p
 roposed cryptosystem parameters.\n\n \n 
DTSTAMP:20250707T182205Z
END:VEVENT
END:VCALENDAR