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:69ce87b769592
DTSTART;TZID=America/Toronto:20251203T103000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20251203T113000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/crypto-readi
 ng-group-nic-swanson
SUMMARY:Crypto Reading Group -Nic Swanson
CLASS:PUBLIC
DESCRIPTION:TITLE:PRISM: Simple And Compact Identification and Signatures F
 rom\nLarge Prime Degree Isogenies\n\nSpeaker\n Nic Swanson\n\nAffiliation\
 n University of Waterloo\n\nLocation\n MC 5479\n\nABSTRACT: The problem o
 f computing an isogeny of large prime degree\nfrom a supersingular ellipti
 c curve of unknown endomorphism ring is\nassumed to be hard both for class
 ical as well as quantum computers. \n\nIn this work\, we first build a tw
 o-round identification protocol whose\nsecurity reduces to this problem. T
 he challenge consists of a random\nlarge prime q and the prover simply rep
 lies with an efficient\nrepresentation of an isogeny of degree q from its 
 public key.  \nUsing the hash-and-sign paradigm\, we then derive a signat
 ure scheme\nwith a very simple and flexible signing procedure and prove it
 s\nsecurity in the standard model.  \nOur optimized C implementation of t
 he signature scheme shows that\nsigning is roughly 1.8× faster than all S
 QIsign variants\, whereas\nverification is 1.4× times slower. The sizes o
 f the public key and\nsignature are comparable to existing schemes.
DTSTAMP:20260402T151359Z
END:VEVENT
END:VCALENDAR