Filter by content type

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

Remove all filters

655 results

    • Seminar

    • Cryptography

    Soutenance de thèse: Study and design of new encryption primitives based on rank metric error correcting codes

    • December 10, 2021

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

    Speaker : Ba Duc Pham - Rennes

    In 2005, Faure and Loidreau proposed a new rank-metric cryptosystem inspired from the Hamming metric scheme of Augot-Finiasz in 2003. In 2018, it was broken by the attack of Gaborit, Otmani and Kalachi. Recently, there are some attempts of repairing the Faure-Loidreau scheme, for example the work of Renner, Puchinger and Wachter–Zeh which is called LIGA. In this thesis, we also introduce a new[…]
    • 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[…]
    • Seminar

    • Cryptography

    Public Key Encryption with Flexible Pattern Matching

    • March 25, 2022 (00:00 - 23:59)

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

    Speaker : 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[…]
    • Seminar

    • Cryptography

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

    • February 07, 2020

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

    Speaker : 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[…]
    • Seminar

    • Cryptography

    Decoding Supercodes of Gabidulin Codes and Applications to Cryptanalysis

    • October 22, 2021

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

    Speaker : 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,[…]