Sommaire

  • Cet exposé a été présenté le 14 novembre 2014.

Description

  • Orateur

    François-Xavier Standaert - Université Catholique de Louvain

In this talk, I will describe the family of authenticated encryption (with associated data) algorithms SCREAM and iSCREAM. They are based on Liskov et al.'s Tweakable Authenticated Encryption (TAE) mode with the new tweakable block ciphers Scream and iScream. The main desirable features of SCREAM and iSCREAM are:<br/> * A simple and regular design allowing excellent performances on a wide range of architectures, in particular if masking is implemented as a side-channel countermeasure;<br/> * Inheriting from TAE, security beyond the birthday bound, i.e. a 128-bit security guarantee with up to 2128 bits of data processed with the same 128-bit key;<br/> * Low overheads for the authentication mode (e.g. no extra cipher calls to generate masks);<br/> * Fully parallelisable authenticated encryption with minimal ciphertext length.<br/> In addition, iSCREAM allows compact implementations for combined encryption and decryption, by taking advantage of involutive components in its underlying cipher iScream.

Prochains exposés

  • Journées C2: pas de séminaire

    • 03 avril 2026 (13:45 - 14:45)

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

  • Endomorphisms via Splittings

    • 10 avril 2026 (13:45 - 14:45)

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

    Orateur : Min-Yi Shen - No Affiliation

    One of the fundamental hardness assumptions underlying isogeny-based cryptography is the problem of finding a non-trivial endomorphism of a given supersingular elliptic curve. In this talk, we show that the problem is related to the problem of finding a splitting of a principally polarised superspecial abelian surface. In particular, we provide formal security reductions and a proof-of-concept[…]
    • Cryptography

Voir les exposés passés