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.
734 résultats
-
-
Séminaire
-
Cryptographie
Cryptanalysis of code-based cryptosystems using the square-code distinguisher
Orateur : Mathieu Lequesne - INRIA
Many code-based cryptosystems have been proposed recently, especially in response to the call for post-quantum cryptography standardization issued by the National Institute of Standards and Technologie. Most code-based cryptosystem rely on the same idea: an error-correcting code with some special structural properties (including good error-correction capacity) serves as the private key. This code[…] -
-
-
Séminaire
-
Cryptographie
Decoding Supercodes of Gabidulin Codes and Applications to Cryptanalysis
Orateur : Maxime Bombar - Ecole Polytechnique
Error correcting codes are well known to provide possible candidates for building quantum safe cryptographic primitives. Besides the Hamming metric which has a long-standing history, one may consider other metrics such as the rank metric. Gabidulin codes are the rank metric analogue of Reed-Solomon codes and can be efficiently decoded up to half the minimum distance. However, beyond this radius,[…] -
-
-
Séminaire
-
Cryptographie
Cryptographie post-quantique fondée sur les codes : les candidats à la standardisation
Orateur : Nicolas Sendrier - INRIA
Au second tour du processus de standardisation du NIST, il reste 7 candidats dont la sécurité est fondée sur les code correcteurs, tous sont des mécanismes d'échange de clé. Nous les classifierons selon leurs hypothèses de sécurité et leurs propriétés. Nous trouvons les systèmes « historiques » (Classic McEliece et NTS-KEM), les systèmes fondés sur des matrices creuses et quasi-cycliques (BIKE,[…] -
-
-
Séminaire
-
Cryptographie
PARASITE: PAssword Recovery Attack against Srp Implementations in ThE wild
Orateur : Daniel De Almeida Braga - Université Rennes 1
Protocols for password-based authenticated key exchange (PAKE) allow two users sharing only a short, low-entropy password to establish a secure session with a cryptographically strong key. The challenge in designing such protocols is that they must resist offline dictionary attacks in which an attacker exhaustively enumerates the dictionary of likely passwords in an attempt to match the used[…] -
-
-
Séminaire
-
Cryptographie
Practical Strategy-Resistant Privacy-Preserving Elections
Orateur : Quentin Santos - Orange
Recent advances in cryptography promise to let us run com- plex algorithms in the encrypted domain. However, these results are still mostly theoretical since the running times are still much larger than their equivalents in the plaintext domain. In this context, Majority Judgment is a recent proposal for a new voting system with several interesting practical advantages, but which implies a more[…] -
-
-
Séminaire
-
Cryptographie
Quantum security of the Fiat-Shamir transform of commit and open protocols
Orateur : André Chailloux - INRIA
Applying the Fiat-Shamir transform on identification schemes is one of the main ways of constructing signature schemes. While the classical security of this transformation is well understood, there are still many cases for which we do not know whether the quantum security holds or not. In this paper, we show that if we start from a commit-and-open identification scheme, where the prover first[…] -