Table of contents

  • This session has been presented March 14, 2003.

Description

  • Speaker

    Eliane Jeaulme - DCSSI

Dans cet exposé, nous présenterons les principaux modes de chiffrement et d'authentification en cryptographie à clef secrète. Nous verrons ensuite le principe des preuves de sécurité de ces modes : les hypothèses de sécurité, le mécanisme de preuve et les théorèmes énonçant la sécurité. Nous détaillerons une application de ce principe de preuve sur le mode d'authentification RMAC. Ce mode utilise des valeurs aléatoires dans la génération du code d'authentification de message et offre une sécurité au delà du paradoxe des anniversaires.

Next sessions

  • Dissecting CRAFT, a full-round attack

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

    • Batiment 32A salle 15

    Speaker : Eran Lambooij - Inria

    I will present the first full-round key recovery attack on CRAFT, a block cipher introduced at ToSC 2019. The attack builds on the previous observation (ToSC 2026) that the state of CRAFT can be decomposed into two parts that barely exchange information. We transform this property into a dissection attack on the full-round cipher. This shows that in some cases we can elevate the dissection attack[…]

    • Cryptography

  • 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