Description
In this talk, I will discuss the decoding of Gabidulin and related codes from a cryptographic point of view, pointing out that these codes can be decoded solely from the knowledge of a generator matrix. I will also present an extension of Gibson and Overbeck attacks on the generalized GPT encryption scheme (instantiated with the Gabidulin code) for different ranks of the distortion matrix. Finally we will see how we can apply this attack to the case of an instantiation with twisted Gabidulin codes. This is a joint work with Alain Couvreur.
Next sessions
-
CryptoVerif: a computationally-sound security protocol verifier
Speaker : Bruno Blanchet - Inria
CryptoVerif is a security protocol verifier sound in the computational model of cryptography. It produces proofs by sequences of games, like those done manually by cryptographers. It has an automatic proof strategy and can also be guided by the user. It provides a generic method for specifying security assumptions on many cryptographic primitives, and can prove secrecy, authentication, and[…]-
Cryptography
-