Filter by content type

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

Remove all filters

717 results

    • Seminar

    • Cryptography

    Designing and deploying post-quantum cryptography

    • March 08, 2019

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

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

    • Cryptography

    Cryptography based on rank metric codes

    • November 08, 2019

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

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

    • Cryptography

    On the design and implementation of scalar multiplication algorithms

    • November 16, 2018

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

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

    • Cryptography

    Approx-SVP in Ideal Lattices with Pre-processing

    • May 24, 2019

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

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

    • Cryptography

    Design de cryptographie white-box : n'oublions pas la grey-box

    • December 02, 2016

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

    Speaker : Philippe Teuwen - QuarksLab

    Bien que toutes les tentatives académiques actuelles pour créer des primitives cryptographiques standard en white-box aient été cassées, il y a encore un grand nombre d'entreprises qui vendent des solutions "sécurisées" de cryptographie white-box. Afin d'évaluer le niveau de sécurité de solutions en boîte blanche, nous verrons de nouvelles approches qui ne nécessitent ni connaissance des tables[…]
    • Seminar

    • Cryptography

    Falcon un schéma de signature sur les réseaux euclidiens NTRU

    • June 30, 2017

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

    Speaker : Thomas Ricosset - Thales Communications & Security, INP-ENSEEIHT

    Dans cette présentation je décrirai le schéma de signature Falcon, pour "FAst Fourier Lattice-based COmpact signatures over NTRU", basé sur le schéma de signature hash-and-sign de Gentry, Peikert et Vaikuntanathan. Je présenterai les outils et techniques permettant à Falcon d'offrir aujourd'hui, à faibles coûts, les signatures les plus compactes sur les réseaux euclidiens : une version randomisée[…]