Table of contents

  • This session has been presented January 17, 2020.

Description

  • Speaker

    Guilhem Castagnos - Université Bordeaux 1

More than 30 years ago, Buchmann and Williams proposed using ideal class groups of imaginary quadratic fields in cryptography with a Diffie-Hellman style key exchange protocol. After several twists, there has been in recent years a new interest in this area. This rebirth is mainly due to two features. First, class groups of imaginary quadratic fields allow the design of cryptographic protocols that do not require a trusted setup. This particularity has been used for example to build cryptographic accumulators and verifiable delay functions. Secondly, using these groups, we proposed in 2015 a versatile encryption scheme, linearly homomorphic modulo a prime that has found many applications, for instance in secure two-party computation.<br/> In this talk, I will give an overview of cryptography based on class groups of imaginary quadratic fields and discuss recent developments.<br/> lien: http://desktop.visio.renater.fr/scopia?ID=727785***7248&autojoin

Next sessions

  • Key Attack on the ACDGV Matrix Encryption Scheme

    • September 25, 2026 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Anmoal Porwal - Technical University of Munich

    I will present our key-recovery attack on the ACDGV public-key encryption scheme proposed at ASIACRYPT 2024 by Aragon, Couvreur, Dyseryn, Gaborit, and Vinçotte. The secret key is a Gabidulin code hidden by appending random rows and columns and by left- and right-multiplication with invertible matrices. Our attack exploits the resulting algebraic structure to recover an equivalent secret key. It[…]

    • Cryptography

    • Asymmetric primitive

  • Module Learning With Errors and Structured Extrapolated Dihedral Cosets

    • October 02, 2026 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Jinwei Zheng - Télécom Paris

    The Module Learning With Errors (MLWE) problem is the fundamental hardness assumption underlying the key encapsulation and signature schemes ML-KEM and ML-DSA, which have been selected by NIST for post-quantum cryptography standardization. Understanding its quantum hardness is crucial for assessing the security of these standardized schemes.   Inspired by the equivalence between LWE and[…]

    • Cryptography

Show previous sessions
Page top