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:69ce7e0c6541e
DTSTART;TZID=America/Toronto:20241025T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20241025T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-subhadip-singha
SUMMARY:Tutte colloquium-Subhadip Singha
CLASS:PUBLIC
DESCRIPTION:TITLE: Concrete analysis of a few aspects of lattice-based\ncry
 ptography\n\nSPEAKER:\n Subhadip Singha\n\nAFFILIATION:\n University of Wa
 terloo\n\nLOCATION:\n MC 5501\n\nABSTRACT: A seminal 2013 paper by Lyubash
 evsky\, Peikert\, and Regev\nproposed using ideal lattices as a foundation
  for post-quantum\ncryptography\, supported by a polynomial-time security 
 reduction from\nthe approximate Shortest Independent Vectors Problem (SIVP
 ) to the\nDecision Learning With Errors (DLWE) problem in ideal lattices. 
 In our\nconcrete analysis of this multi-step reduction\, we find that the\
 nreduction’s tightness gap is so significant that it undermines any\nmea
 ningful security guarantees. Additionally\, we have concerns about\nthe fe
 asibility of the quantum aspect of the reduction in the near\nfuture. More
 over\, when making the reduction concrete\, the\napproximation factor for 
 the SIVP problem turns out to be much larger\nthan anticipated\, suggestin
 g that the approximate SIVP problem may not\nbe hard for the proposed cryp
 tosystem parameters.\n\n 
DTSTAMP:20260402T143244Z
END:VEVENT
END:VCALENDAR