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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69dfd0bcacfd5
DTSTART;TZID=America/Toronto:20260227T103000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260227T113000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/crypto-readi
 ng-group-jack-zhao-post-quantum-pke-unstructured
SUMMARY:Crypto Reading Group - Jack Zhao-Post-Quantum PKE from Unstructured
 \nNoisy Linear Algebraic Assumptions: Beyond LWE and Alekhnovich’s LPN
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n\n Jack Zhao\n\nAFFILIATION:\n University of Waterloo
 \n\nLOCATION:\n MC 6029\n\nABSTRACT: Much of post-quantum PKE from unstru
 ctured noisy linear\nalgebra relies on LWE or Alekhnovich’s LPN: both as
 sume samples of\nthe form (A\, As+e) are computationally indistinguishable
  from (A\, u)\,\nbut with different noise models. LWE uses “short” err
 ors\, while\nAlekhnovich LPN uses sparse errors. Motivated by uncertainty 
 around\nfuture cryptanalytic advances\, we ask whether one can still obtai
 n PKE\nfrom noisy linear assumptions even if both LWE and Alekhnovich LPN\
 nwere broken. We talk about two new assumptions: Learning with Two\nErrors
  (LW2E)\, which mixes an LWE-style short error with an LPN-style\nsparse e
 rror\, and Learning with Short and Sparse Errors (LWSSE)\, which\nuses err
 ors that are simultaneously short and sparse but denser than\nAlekhnovich 
 LPN.
DTSTAMP:20260415T175404Z
END:VEVENT
END:VCALENDAR