The Isogeny Club

A bi-weekly virtual seminar for young isogenists.

Upcoming talks

  1. Maria Corte-Real Santos - [superlative]Solver: Attacking the General Isogeny Problem
    University College London, personal page
    October 11th, 17:00 (CEST).

    The general supersingular isogeny problem is the foundational hardness assumption underpinning isogeny-based cryptography. Its conjectured classical and quantum hardness has cemented isogenies as a promising tool for building post-quantum secure protocols.

    In this talk, we will look at the general isogeny problem in low dimensions. More specifically, we consider the hardness of finding an isogeny between two given supersingular elliptic curves or two superspecial abelian surfaces defined over 𝔽p2. Viewing these as path finding problems in a related isogeny graph, we introduce a general framework for solving these problems and present the state-of-the-art attacks against them. We will also discuss a strategy for improving their concrete complexity, based on joint work with Craig Costello, Sam Frengley and Jia Shi.

  2. Antonin Leroux
    DGA, personal page
    October 25th, 17:00 (CEST).

  3. Tako Boris Fouotsa
    EPFL, personal page
    November 8th, 17:00 (CET).

  4. Sabrina Kunzweiler
    RUB, personal page
    November 22nd, 17:00 (CET).

  5. Marc Houben
    Universiteit Leiden, personal page
    December 13th, 17:00 (CET).
    Note: one week later than regular schedule.

Previous talks

  1. Thomas Decru - Breaking SIKE
    KU Leuven
    September 13th, 17:00 (CEST).

    Thomas paints a somewhat broader picture of the genus-2 isogeny setting to showcase how Wouter Castryck and Thomas found all the pieces of the puzzle to break SIKE.

    Personal pageSlidesRecordingDiscussion

  2. Bruno Sterner - git commit -m “isogenies”
    University of Surrey
    September 27th, 17:00 (CEST).

    Supersingular isogeny graphs possess many properties that make it an interesting object to study mathematically as well as attempt to apply for cryptographic purposes. In this talk, Bruno will present one of these properties and showcase how it can be applied to construct a commitment scheme. This commitment scheme has strong security properties and doesn’t require random oracles.

    Personal pageSlidesRecordingDiscussion

Reach Jonathan and Krijn
via to join!

Overview of discussion available at here.

Twitter here.

YouTube here.