Low Rank Parity Check codes and their application to cryptography
Langue
en
Communication dans un congrès
Ce document a été publié dans
PREPROCEEDINGS The International Workshop on Coding and Cryptography WCC 2013, PREPROCEEDINGS The International Workshop on Coding and Cryptography WCC 2013, The International Workshop on Coding and Cryptography (WCC 13), 2013-04-15, Bergen. 2013p. 13 p.
Résumé en anglais
In this paper we introduce a new family of rank metric codes: the Low Rank Parity Check codes for which we propose an e cient probabilistic decoding algorithm. This family of codes can be seen as the equivalent of classical ...Lire la suite >
In this paper we introduce a new family of rank metric codes: the Low Rank Parity Check codes for which we propose an e cient probabilistic decoding algorithm. This family of codes can be seen as the equivalent of classical LDPC codes for the rank metric. We then propose to use these codes for cryptography in the McEliece encryption setting. At the di erence of previous encryption algorithms based on rank metric -especially based on Gabidulin codes -, the codes we use have a very poor structure. Our cryptosystem can be seen as an equivalent to the NTRU cryptosystem [16] (and also to the more recent MDPC[23] cryptosystem) in a rank metric context. Overall our system permits to achieve a very low public key of 1517 bits for a security of 280, moreover our system is very fast, with a decryption failure which can be made arbitrarily small.< Réduire
Mots clés en anglais
Public key cryptosystem
rank metric
Origine
Importé de halUnités de recherche