Filter by content type

Select one or more filters. This choice will reload the page to display the filtered results.

Remove all filters

716 results

    • Seminar

    • Cryptography

    Elliptic curves for SNARKs

    • September 01, 2022

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

    Speaker : Youssef El Housni - LIX

    At CANS’20, El Housni and Guillevic introduced a new 2-chain of pairing-friendly elliptic curves for recursive zero-knowledge Succinct Non-interactive ARguments of Knowledge (zk-SNARKs) made of the former BLS12-377 curve (a Barreto–Lynn–Scott curve over a 377- bit prime field) and the new BW6-761 curve (a Brezing–Weng curve of embedding degree 6 over a 761-bit prime field). First we generalise the[…]

    • Seminar

    • Cryptography

    New Representations of the AES Key Schedule

    • June 10, 2022

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

    Speaker : Clara Pernot - INRIA Paris

    In this talk we present a new representation of the AES key schedule, with some implications to the security of AES-based schemes. In particular, we show that the AES-128 key schedule can be split into four independent parallel computations operating on 32 bits chunks, up to linear transformation. Surprisingly, this property has not been described in the literature after more than 20 years of[…]

    • Seminar

    • Cryptography

    Fault tolerant algorithms via decoding: Interleaving techniques

    • June 17, 2022

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

    Speaker : Eleonora Guerrini - Université Montpellier

    Evaluation Interpolation algorithms are a key tool for the algebraic decoding of a large class of codes, including the famous Reed Solomon codes. Recent techniques allow the use of this type of decoding in the more general setting of fault tolerant algorithms, where one has to interpolate erroneous data (potentially computed by an untrusted entity). In this talk we will present algorithms to[…]

    • Seminar

    • Cryptography

    Soutenance de thèse: Algebraic Cryptanalysis of the Shortest Vector Problem in Ideal Lattices

    • June 13, 2022

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

    Speaker : Olivier Bernard - Rennes

    • Seminar

    • Cryptography

    Lattice-based signatures: from construction to implementation

    • November 29, 2019

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

    Speaker : Pauline Bert - soutenance de thèse, amphi P de l'ISTIC, 14h

    Lattice-based cryptography is one of the major line of research to build post-quantum public key primitives. In this thesis, we discuss about digital signatures constructions and their implementation. We first describe a Fiat-Shamir transformation from an identification scheme using rejection sampling to a digital signature secure in the random oracle model. Then we describe an identity-based[…]

    • Seminar

    • Cryptography

    Code-based postquantum cryptography : candidates to standardization

    • April 23, 2021

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

    Speaker : Nicolas Sendrier - INRIA

    At the third round of the NIST standardization process, three candidates remain with a security based on error correcting codes, all are key exchange mechanisms. We will explore them according to their security assumptions and properties. Among them, we find an historical scheme (Classic McEliece), as well as schemes using sparse and quasi-cyclic matrices (BIKE and HQC). We will examine pros and[…]
Page top