Description
The McEliece scheme is a generic framework allowing to use any error correcting code which disposes of an efficient decoding algorithm to design an encryption scheme by hiding a generator matrix of this code.
In the context of rank metric, we propose a generalization of the McEliece frame to matrix codes. From a vector code, we compute a matrix version of this code, that is hidden in such a way that the code obtained is indistinguishable from a random code. We propose to mask the linearity of the vector code on the extension, which implies a bigger public key (since the code is less structured) but allows to allows to keep a very small size of ciphertext. It results in an encryption scheme whose security relies on a generic instance of the MinRank problem, known to be NP-complete.
Applying it with Gabidulin codes, our approach gives a better trade-off between ciphertexts and public keys sizes than the classic McEliece scheme. For 128 bits of security, we propose parameters with ciphertext of size 65B and public key of size 98kB.
Travail en commun avec Nicolas Aragon, Alain Couvreur, Victor Dyseryn, Philippe Gaborit
Practical infos
Next sessions
-
SoK: Security of the Ascon Modes
Speaker : Charlotte Lefevre - Radboud University
The Ascon authenticated encryption scheme and hash function of Dobraunig et al (Journal of Cryptology 2021) were recently selected as winner of the NIST lightweight cryptography competition. The mode underlying Ascon authenticated encryption (Ascon-AE) resembles ideas of SpongeWrap, but not quite, and various works have investigated the generic security of Ascon-AE, all covering different attack[…] -
Comprehensive Modelling of Power Noise via Gaussian Processes with Applications to True Random Number Generators
Speaker : Maciej Skorski - Laboratoire Hubert Curien
The talk examines power noise modelling through Gaussian Processes for secure True Random Number Generators. While revisiting one-sided fractional Brownian motion, we obtain novel contributions by quantifying posterior uncertainty in exact analytical form, establishing quasi-stationary properties, and developing rigorous time-frequency analysis. These results are applied to model oscillator[…]-
Cryptography
-
TRNG
-
-
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
-