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.
721 résultats
-
-
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
Soutenance de thèse: Theoretical Hardness of Algebraically Structured Learning With Errors
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
On weak keys in QC-MDPC schemes
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: Study and design of new encryption primitives based on rank metric error correcting codes
Orateur : Ba Duc Pham - Rennes
In 2005, Faure and Loidreau proposed a new rank-metric cryptosystem inspired from the Hamming metric scheme of Augot-Finiasz in 2003. In 2018, it was broken by the attack of Gaborit, Otmani and Kalachi. Recently, there are some attempts of repairing the Faure-Loidreau scheme, for example the work of Renner, Puchinger and Wachter–Zeh which is called LIGA. In this thesis, we also introduce a new[…] -