Description
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 is transformed and displayed in a form that is (supposedly) indistinguishable from a random code: this serves as the public key. However, in some cases, one can distinguish the public key from a random code. We will present such a distinguisher, the "squared code distinguisher", and how this can be used to perform key recovery attacks in polynomial time on some cryptosystems such as the RLCE scheme [Wang 2016] or the Expanded Reed-Solomon scheme [Khathuria, Rosenthal, Weger 2019].<br/> lien: http://desktop.visio.renater.fr/scopia?ID=723838***5009&autojoin
Next sessions
-
Encryption homomorphe sans bruit à l'aide de groupes
Speaker : Pierre Guillot - Ravel Technologies (dispo Université de Strasbourg, IRMA)
Je vais rappeler les travaux de Nuida et Ostrovski sur l'utilisation des groupes pour l'élaboration de schémas cryptographiques homomorphes. Je vais présenter nos travaux qui fournissent des encodages à la fois plus efficaces et plus généraux, et qui déterminent exactement quels groupes peuvent être utilisés. Puis je vais discuter GRAFHEN, un protocole qui utilise ces idées. Je dirai juste[…]-
Cryptography
-