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:69dd5287aeb34
DTSTART;TZID=America/Toronto:20260306T103000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260306T113000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/crypto-readi
 ng-group-leonardo-colo-cube-isogeny-based
SUMMARY:Crypto Reading Group - Leonardo Colò-IS-CUBE: An isogeny-based\nco
 mpact KEM using a boxed SIDH diagram
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n\n Leonardo Colò\n\nAFFILIATION:\n University of Wat
 erloo\n\nLOCATION:\n MC 6029\n\nABSTRACT: Isogeny-basedcryptographyisoneo
 fthecandidatesforpost-\nquantum cryptography. One of the benefits of using
  isogeny-based\ncryptography is its compactness. In particular\, a key exc
 hange scheme\nSIDH allowed us to use a 4λ-bit prime for the security para
 meter λ.\nUnfortunately\, SIDH was broken in 2022 by some studies. After 
 that\,\nsome isogeny-based key exchange and public key encryption schemes 
 have\nbeen proposed\; however\, most of these schemes use primes whose siz
 es\nare not guaranteed as linearly related to the security parameter λ.\n
 As far as we know\, the remaining schemes have not been implemented due\nt
 o the computation of isogenies of high dimensional abelian varieties\,\nor
  they need to use a “weak” curve (i.e.\, a curve whose\nendomorphism r
 ing is known) as the starting curve.\n\nIn this study\, we propose a novel
  compact isogeny-based key encapsula-\ntion mechanism named IS-CUBE via Ka
 ni’s theorem and a 3-dimensional\nSIDH diagram. A prime used in IS-CUBE 
 is of the size of about 8λ\nbits\, and we can use a random supersingular 
 elliptic curve for the\nstarting curve. The public key of IS-CUBE is about
  3 times larger than\nthat of SIKE\, and the ciphertext of IS-CUBE is abou
 t 4 times larger\nthan that of SIKE from theoretical estimation. In practi
 ce\, compared\nto FESTA\, the public key of IS-CUBE is slightly larger and
  its\nciphertext is slightly smaller. \nThe core idea of IS-CUBE comes fro
 m the hardness of some already known\ncomputational problems and a novel c
 omputational problem (the Long\nIsogeny with Torsion (LIT) problem)\, whic
 h is the problem to compute a\nhidden isogeny from two given supersingular
  elliptic curves and\ninformation of torsion points of relatively small or
 der.
DTSTAMP:20260413T203103Z
END:VEVENT
END:VCALENDAR