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:69ce869d604e2
DTSTART;TZID=America/Toronto:20260213T103000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260213T113000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/crypto-readi
 ng-group-youcef-mokrani-0
SUMMARY:Crypto Reading Group - Youcef Mokrani
CLASS:PUBLIC
DESCRIPTION:TITLE: Adaptive Attacks Against FESTA Without Input Validation
  or\nConstant-Time Implementation\n\nSPEAKER:\n\n Youcef Mokrani\n\nAFFILI
 ATION:\n University of Waterloo\n\nLOCATION:\n MC 6029\n\nABSTRACT: \n\nA
  FESTA trapdoor function is an isogeny-based trapdoor function based\non a
 n attempt to apply Kani’s theorem to cryptography. This paper\nclaims th
 at there are adaptive attacks for a FESTA-based scheme if\nthis scheme doe
 s not check the correctness of the input matrix or is\nnot implemented in 
 constant time. Our attacks do not apply to the\nconstant-time implementati
 on of the IND-CCA PKE scheme named FESTA\nproposed in the FESTA original p
 aper. In this paper\, we provide\nadaptive attacks for a FESTA trapdoor fu
 nction using auxiliary\noracles\, which reveals the secret key of the func
 tion. These oracles\nmay be constructed if the FESTA trapdoor function is 
 used without\nvalidating the input matrix or implemented in non-constant t
 ime.
DTSTAMP:20260402T150917Z
END:VEVENT
END:VCALENDAR