Low Rank Parity Check codes and their application to cryptography
| hal.structure.identifier | DMI [XLIM-DMI] | |
| dc.contributor.author | GABORIT, Philippe | |
| hal.structure.identifier | DMI [XLIM-DMI] | |
| dc.contributor.author | MURAT, Gaétan | |
| hal.structure.identifier | XLIM [XLIM] | |
| dc.contributor.author | RUATTA, Olivier | |
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| dc.contributor.author | ZEMOR, Gilles | |
| dc.contributor.editor | Lilya Budaghyan | |
| dc.contributor.editor | Tor Helleseth | |
| dc.contributor.editor | Matthew G. Parker | |
| dc.date.accessioned | 2024-04-04T02:20:51Z | |
| dc.date.available | 2024-04-04T02:20:51Z | |
| dc.date.issued | 2013 | |
| dc.date.conference | 2013-04-15 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/189523 | |
| dc.description.abstractEn | 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. | |
| dc.language.iso | en | |
| dc.source.title | PREPROCEEDINGS The International Workshop on Coding and Cryptography WCC 2013 | |
| dc.subject.en | Public key cryptosystem | |
| dc.subject.en | rank metric | |
| dc.title.en | Low Rank Parity Check codes and their application to cryptography | |
| dc.type | Communication dans un congrès | |
| bordeaux.page | 13 p. | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | The International Workshop on Coding and Cryptography (WCC 13) | |
| bordeaux.country | NO | |
| bordeaux.title.proceeding | PREPROCEEDINGS The International Workshop on Coding and Cryptography WCC 2013 | |
| bordeaux.conference.city | Bergen | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00913719 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.conference.end | 2013-04-19 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00913719v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=PREPROCEEDINGS%20The%20International%20Workshop%20on%20Coding%20and%20Cryptography%20WCC%202013&rft.date=2013&rft.spage=13%20p.&rft.epage=13%20p.&rft.au=GABORIT,%20Philippe&MURAT,%20Ga%C3%A9tan&RUATTA,%20Olivier&ZEMOR,%20Gilles&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||