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.
765 résultats
-
-
Séminaire
-
Cryptographie
Syndrome Decoding in the Head – Shorter Signatures from Zero-Knowledge proofs
Orateur : Thibauld Feneuil - CryptoExperts et Sorbonne Université
In this talk, I will present a new zero-knowledge proof of knowledge for the syndrome decoding (SD) problem on random linear codes. Instead of using permutations like most of the existing protocols, we rely on the MPC-in-the-head paradigm in which we reduce the task of proving the low Hamming weight of the SD solution to proving some relations between specific polynomials. Specifically, we propose[…] -
-
-
Séminaire
-
Cryptographie
Elliptic curves for SNARKs
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
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
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
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
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[…] -
-
-
Séminaire
-
Cryptographie
Public Key Encryption with Flexible Pattern Matching
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[…] -