Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
708 results
-
-
Seminar
-
Cryptography
Cryptanalysis of code-based cryptosystems using the square-code distinguisher
Speaker : 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[…] -
-
-
Seminar
-
Cryptography
Decoding Supercodes of Gabidulin Codes and Applications to Cryptanalysis
Speaker : 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,[…] -
-
-
Seminar
-
Cryptography
Optimisation des Principaux Composants des Chiffrements par Bloc
Speaker : Baptiste Lambin - soutenance de thèse salle Métivier à l'IRISA, 14h
La sécurité des chiffrements par bloc évolue constamment au fur et à mesure que de nouvelles techniques de cryptanalyse sont découvertes. Lors de la conception de nouveaux chiffrements par bloc, il est donc nécessaire de considérer ces nouvelles techniques dans l'analyse de sécurité. Dans cette thèse, nous montrons comment construire certaines opérations internes des chiffrements par bloc pour[…] -
-
-
Seminar
-
Cryptography
Learning With Errors and Extrapolated Dihedral Cosets Problem
Speaker : Weiqiang Wen - ENS de Lyon
The hardness of the learning with errors (LWE) problem is one of the most fruitful resources of modern cryptography. In particular, it is one of the most prominent candidates for secure post-quantum cryptography. Understanding its quantum complexity is therefore an important goal. We show that under quantum polynomial time reductions, LWE is equivalent to a relaxed version of the dihedral coset[…] -
-
-
Seminar
-
Cryptography
Number Systems and Cryptography, some examples
Speaker : Jean-Claude Bajard - Sorbonne Université
Number systems are behind a lot of implementations. The role of representation is often underrated while its importance in implementation is crucial. We survey here some classes of fundamental systems that could be used in crypotgraphy. We present three main categories:<br/> - systems based on the Chinese Remainder Theorem which enter more generally in the context of polynomial interpolation,<br/[…] -
-
-
Seminar
-
Cryptography
Practical Strategy-Resistant Privacy-Preserving Elections
Speaker : 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[…] -