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.
704 résultats
-
-
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: 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
The generalized quaternion isogeny path problem.
Orateur : Antonin Leroux - LIX
The correspondence between maximal orders in a quaternion algebra and supersingular elliptic curves has uncovered new perspectives in the field of isogeny-based cryptography. The KLPT algorithm of Kohel et al. in 2014 introduces an algorithm solving the quaternion isogeny path problem in polynomial time. Studying this problem has applications both constructive and destructive. It has allowed to[…] -
-
-
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[…] -
-
-
Séminaire
-
Cryptographie
Learning Strikes Again: the Case of the DRS Signature Scheme
Orateur : Yu Yang - CWI Amsterdam
Lattice signature schemes generally require particular care when it comes to preventing secret information from leaking through signature transcript. For example, the Goldreich-Goldwasser-Halevi (GGH) signature scheme and the NTRUSign scheme were completely broken by the parallelepiped-learning attack of Nguyen and Regev (Eurocrypt 2006). Several heuristic countermeasures were also shown[…] -
-
-
Séminaire
-
Cryptographie
Homomorphic Signatures on Randomizable Ciphertexts
Orateur : David Pointcheval - ENS
Anonymity is a primary ingredient for our digital life. Several tools have been designed to address it such as, for authentication, blind signatures, group signatures or anonymous credentials and, for confidentiality, randomizable encryption or mix-nets.<br/> When it comes to complex electronic voting schemes, random shuffling of ciphertexts with mix-nets is the only known tool. Such mix-nets are[…] -