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

764 résultats

    • Séminaire

    • Cryptographie

    Elliptic curves for SNARKs

    • 01 septembre 2022

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

    Orateur : Youssef El Housni - LIX

    At CANS’20, El Housni and Guillevic introduced a new 2-chain of pairing-friendly elliptic curves for recursive zero-knowledge Succinct Non-interactive ARguments of Knowledge (zk-SNARKs) made of the former BLS12-377 curve (a Barreto–Lynn–Scott curve over a 377- bit prime field) and the new BW6-761 curve (a Brezing–Weng curve of embedding degree 6 over a 761-bit prime field). First we generalise the[…]
    • Séminaire

    • Cryptographie

    New Representations of the AES Key Schedule

    • 10 juin 2022

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

    Orateur : Clara Pernot - INRIA Paris

    In this talk we present a new representation of the AES key schedule, with some implications to the security of AES-based schemes. In particular, we show that the AES-128 key schedule can be split into four independent parallel computations operating on 32 bits chunks, up to linear transformation. Surprisingly, this property has not been described in the literature after more than 20 years of[…]
    • Séminaire

    • Cryptographie

    Fault tolerant algorithms via decoding: Interleaving techniques

    • 17 juin 2022

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

    Orateur : Eleonora Guerrini - Université Montpellier

    Evaluation Interpolation algorithms are a key tool for the algebraic decoding of a large class of codes, including the famous Reed Solomon codes. Recent techniques allow the use of this type of decoding in the more general setting of fault tolerant algorithms, where one has to interpolate erroneous data (potentially computed by an untrusted entity). In this talk we will present algorithms to[…]
    • Séminaire

    • Cryptographie

    Improved Classical and Quantum Algorithms for Subset-Sum

    • 06 mars 2020

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

    Orateur : André Schrottenloher - INRIA

    We present new classical and quantum algorithms for solving random hard instances of the subset-sum problem, in which we are given n integers on n bits and try to find a subset of them that sums to a given target. This classical NP-complete problem has several applications in cryptography and underlies the security of some proposed post-quantum cryptosystems.<br/> At EUROCRYPT 2010, Howgrave[…]
    • Séminaire

    • Cryptographie

    Workshop mise en oeuvre de la cryptographie post-quantique

    • 17 novembre 2021

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

    Orateur : European CyberWeek - Rennes

    L'inscription est gratuite mais obligatoire, en particulier pour des raisons de jauges. Le nombre de places est limité. Le programme est disponible à l'adresse <a href="https://www.european-cyber-week.eu/cryptographie-post-quantique">https://www.european-cyber-week.eu/cryptographie-post-quantique</a><br/&gt;
    • Séminaire

    • Cryptographie

    Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment

    • 10 avril 2020

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

    Orateur : Emmanuel Thomé - INRIA Nancy

    We report on two new records: the factorization of RSA-240, a 795-bit number, and a discrete logarithm computation over a 795-bit prime field. Previous records were the factorization of RSA-768 in 2009 and a 768-bit discrete logarithm computation in 2016. Our two computations at the 795-bit level were done using the same hardware and software, and show that computing a discrete logarithm is not[…]