Table of contents

  • This session has been presented November 14, 2014.

Description

  • Speaker

    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.

Next sessions

  • Verification of Rust Cryptographic Implementations with Aeneas

    • February 13, 2026 (13:45 - 14:45)

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

    Speaker : Aymeric Fromherz - Inria

    From secure communications to online banking, cryptography is the cornerstone of most modern secure applications. Unfortunately, cryptographic design and implementation is notoriously error-prone, with a long history of design flaws, implementation bugs, and high-profile attacks. To address this issue, several projects proposed the use of formal verification techniques to statically ensure the[…]

  • On the average hardness of SIVP for module lattices of fixed rank

    • March 06, 2026 (13:45 - 14:45)

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

    Speaker : Radu Toma - Sorbonne Université

    In joint work with Koen de Boer, Aurel Page, and Benjamin Wesolowski, we study the hardness of the approximate Shortest Independent Vectors Problem (SIVP) for random module lattices. We use here a natural notion of randomness as defined originally by Siegel through Haar measures. By proving a reduction, we show it is essentially as hard as the problem for arbitrary instances. While this was[…]

  • Journées C2: pas de séminaire

    • April 03, 2026 (13:45 - 14:45)

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

  • Endomorphisms via Splittings

    • April 10, 2026 (13:45 - 14:45)

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

    Speaker : 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

Show previous sessions
Page top