Filtrer par type de contenu

Sélectionnez un ou plusieurs filtres. Ce choix permettra de recharger la page pour afficher les résultats filtrés.

Supprimer tous les filtres

656 résultats

    • Séminaire

    • Cryptographie

    Lattice-based signatures: from construction to implementation

    • 29 novembre 2019

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

    Orateur : 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[…]
    • Séminaire

    • Cryptographie

    Code-based postquantum cryptography : candidates to standardization

    • 23 avril 2021

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

    Orateur : 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[…]
    • Séminaire

    • Cryptographie

    Public Key Encryption with Flexible Pattern Matching

    • 25 mars 2022 (00:00 - 23:59)

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

    Orateur : Elie Bouscatié - Orange

    Many interesting applications of pattern matching (e.g. deep-packet inspection or medical data analysis) target very sensitive data. In particular, spotting illegal behaviour in internet traffic conflicts with legitimate privacy requirements, which usually forces users to blindly trust an entity that fully decrypts their traffic in the name of security. The compromise between traffic analysis and[…]
    • Séminaire

    • Cryptographie

    Cryptanalysis of code-based cryptosystems using the square-code distinguisher

    • 07 février 2020

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

    Orateur : Mathieu Lequesne - INRIA

    Many code-based cryptosystems have been proposed recently, especially in response to the call for post-quantum cryptography standardization issued by the National Institute of Standards and Technologie. Most code-based cryptosystem rely on the same idea: an error-correcting code with some special structural properties (including good error-correction capacity) serves as the private key. This code[…]
    • Séminaire

    • Cryptographie

    Decoding Supercodes of Gabidulin Codes and Applications to Cryptanalysis

    • 22 octobre 2021

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

    Orateur : Maxime Bombar - Ecole Polytechnique

    Error correcting codes are well known to provide possible candidates for building quantum safe cryptographic primitives. Besides the Hamming metric which has a long-standing history, one may consider other metrics such as the rank metric. Gabidulin codes are the rank metric analogue of Reed-Solomon codes and can be efficiently decoded up to half the minimum distance. However, beyond this radius,[…]
    • Séminaire

    • Cryptographie

    Cryptographie post-quantique fondée sur les codes : les candidats à la standardisation

    • 25 mars 2020

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

    Orateur : Nicolas Sendrier - INRIA

    Au second tour du processus de standardisation du NIST, il reste 7 candidats dont la sécurité est fondée sur les code correcteurs, tous sont des mécanismes d'échange de clé. Nous les classifierons selon leurs hypothèses de sécurité et leurs propriétés. Nous trouvons les systèmes « historiques » (Classic McEliece et NTS-KEM), les systèmes fondés sur des matrices creuses et quasi-cycliques (BIKE,[…]