BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Benjamin Smith (Invited Talk) (INRIA and École Polytechnique) DTSTART:20201023T140000Z DTEND:20201023T150000Z DTSTAMP:20260422T195239Z UID:SAC2020/2 DESCRIPTION:Title: Trustless groups of unknown order\nby Benjamin Smith (Invited Talk) (I NRIA and École Polytechnique) as part of Selected Areas in Cryptography 2 020\n\n\nAbstract\nGroups of unknown order have cryptographic applications including time-lock puzzles\, verifiable delay functions\, and accumulato rs. While a trusted authority might simply choose an RSA group and be done with it\, in the trustless setting the problem of generating cryptographi cally secure unknown-order groups is much more subtle. We will explore thi s problem\, comparing two concrete constructions - class groups of quadrat ic imaginary fields\, and Jacobians of hyperelliptic curves - with a speci al focus on the surprisingly complicated issues of security levels and app ropriate key sizes.\n\nBenjamin Smith is a research scientist with INRIA\, the French national computer science research institute\, and an adjunct professor at École Polytechnique. His research is focused on number-theor etic cryptographic algorithms\, especially in (hyper)elliptic curve crypto graphy and isogeny based cryptography.\n LOCATION:https://researchseminars.org/talk/SAC2020/2/ END:VEVENT END:VCALENDAR