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

765 résultats

    • Séminaire

    • Cryptographie

    Post-Quantum Cryptography Hardware: Monolithic Implementations vs. Hardware-Software Co-Design

    • 23 avril 2021

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

    Orateur : Markku-Juhani Saarinen - PQShield

    At PQShield, we've developed dedicated coprocessor(s) for lattice schemes, hash-based signatures, and code-based cryptography. These cryptographic modules are commercial rather than academic and designed to meet customer specifications such as a specific performance profile or Common Criteria and FIPS security certification requirements. Hardware implementations of legacy RSA and Elliptic Curve[…]
    • 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

    On weak keys in QC-MDPC schemes

    • 21 février 2020

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

    Orateur : Valentin Vasseur - INRIA

    Quasi-cyclic moderate density parity check (QC-MDPC) codes allow the design of McEliece-like public-key encryption schemes with compact keys and a security that provably reduces to hard decoding problems for quasi-cyclic codes. Because of these features, QC-MDPC have attracted a lot of interest from the cryptographic community. In particular, the BIKE suite of key exchange mechanisms has been[…]
    • Séminaire

    • Cryptographie

    Soutenance de thèse: Theoretical Hardness of Algebraically Structured Learning With Errors

    • 16 novembre 2021

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

    Orateur : Katharina Boudgoust - Rennes

    The main focus of this PhD thesis lies on the computational problem Learning With Errors (LWE). It is a core building block of lattice-based cryptography, which itself is among the most promising candidates to replace current cryptographic protocols once large-scale quantum computers may be available. The contributions of the present work are separated into two different parts. First, we study the[…]
    • Séminaire

    • Cryptographie

    Post-quantum cryptography based on supersingular isogeny problems?

    • 25 octobre 2019

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

    Orateur : Christophe Petit - University of Birmingham

    The security of many cryptographic protocols in use today relies on the computational hardness of mathematical problems such as integer factorization. These problems can be solved using quantum computers, and therefore most of our security infrastructures will become completely insecure once quantum computers are built. Post-quantum cryptography aims at developing security protocols that will[…]
    • Séminaire

    • Cryptographie

    Grost Distinguishing Attack: A new rebound attack of an AES-like permutation

    • 02 mars 2018

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

    Orateur : Victor Cauchois - DGA et IRMAR

    Grostl est une fonction de hachage finaliste de la compétition SHA-3. Elle est dotée d'une preuve de sécurité qui assure sa résistance aux attaques en collision, pré-image et seconde pré-image sous l'hypothèse que deux permutations internes sont idéales. Ces permutations, 14 tours d'un SPN, calques de l'AES, présentent une structure sensible aux attaques rebond. Ces attaques sont des attaques[…]