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

658 résultats

    • Séminaire

    • Cryptographie

    Key Reinstallation Attacks: Forcing Nonce Reuse in WPA2

    • 23 mars 2018

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

    Orateur : Mathy Vanhoef - KU-Leuven

    We introduce key reinstallation attacks (KRACKs). These attacks abuse features of a protocol to reinstall an already in-use key, thereby resetting nonces and/or replay counters associated to this key. We show that our novel attack technique breaks several handshakes that are used in a WPA2-protected network.<br/> All protected Wi-Fi networks use the 4-way handshake to generate fresh session keys.[…]
    • Séminaire

    • Cryptographie

    Designing and deploying post-quantum cryptography

    • 08 mars 2019

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

    Orateur : Jean-Philippe Aumasson - Teserakt AG

    I will review the hash-based signature submitted to the NIST competition jointly with Guillaume Endignoux, discussing its assurance level and performance. Then I will discuss the challenges of deploying post-quantum cryptography in an end-to-end encryption product for machine-to-machine communications.<br/> lien: http://desktop.visio.renater.fr/scopia?ID=721783***6864&autojoin
    • Séminaire

    • Cryptographie

    Cryptography based on rank metric codes

    • 08 novembre 2019

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

    Orateur : Nicolas Aragon - Université de Limoges, exceptionnellement salle Jersey à l'ISTIC

    In the past few years, the interest for rank metric based cryptography has drastically increased, especially since the beginning of the NIST Post-Quantum Cryptography standardization process : five rank metric based proposals were submitted to the first round. This talk will present the different approaches and tradeoffs for building Key Encapsulation Mechanisms and Public Key Encryption schemes[…]
    • Séminaire

    • Cryptographie

    On the design and implementation of scalar multiplication algorithms

    • 16 novembre 2018

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

    Orateur : Koray Karabina - Florida Atlantic University

    Diffie-Hellman type key exchange protocols and standardized digital signature algorithms all benefit from efficient design and secure implementation of group exponentiation algorithms. This talk will focus on elliptic curve groups and scalar multiplication algorithms derived from differential addition chains. First, I will give a survey of algorithms, and then I will present some recent[…]
    • Séminaire

    • Cryptographie

    Approx-SVP in Ideal Lattices with Pre-processing

    • 24 mai 2019

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

    Orateur : Alice Pellet-Mary - ENS de Lyon

    Finding a short non zero vector in an Euclidean lattice is a well-studied problem which has proven useful to construct many cryptographic primitives. The current best asymptotic algorithm to find a relatively short vector in an arbitrary lattice is the BKZ algorithm. This algorithm recovers a vector which is at most $2^{n^{\alpha}}$ times larger than the shortest non zero vector in time $2^{n^{1-[…]
    • Séminaire

    • Cryptographie

    Some new results on cube attacks against Trivium

    • 14 décembre 2018

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

    Orateur : Tian Tian - Université de Zhengzhou

    Trivium is a bit oriented synchronous stream cipher designed by Cannière and Preneel. It is one of the eSTREAM hardware-oriented finalists and an International Standard under ISO/IEC 29192-3:2012. Cube attacks are an important type of key recovery attack against Trivium. First, I will give a survey on cube attacks against Trivium. Second, I will present our recent results including an algebraic[…]