RAMESSES, a Rank Metric Encryption Scheme with Short Keys
Saved in:
| Title: | RAMESSES, a Rank Metric Encryption Scheme with Short Keys |
|---|---|
| Authors: | Lavauzelle, Julien, Loidreau, Pierre, Pham, Ba-Duc |
| Contributors: | Geometry, arithmetic, algorithms, codes and encryption (GRACE), Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX), École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)-Centre Inria de l'Institut Polytechnique de Paris, Centre Inria de Saclay, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre Inria de Saclay, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Institut de Recherche Mathématique de Rennes (IRMAR), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-École normale supérieure - Rennes (ENS Rennes)-Université de Rennes 2 (UR2)-Centre National de la Recherche Scientifique (CNRS)-INSTITUT AGRO Agrocampus Ouest, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro) |
| Source: | https://hal.science/hal-02426624 ; 2020. |
| Publisher Information: | CCSD |
| Publication Year: | 2020 |
| Collection: | Archive Ouverte de l'Université Rennes (HAL) |
| Subject Terms: | Post-quantum cryptography, encryption scheme, Gabidulin codes, rank-metric decoding problems, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT] |
| Description: | We present a rank metric code-based encryption scheme with key and ciphertext sizes comparable to that of isogeny-based cryptography for an equivalent security level. The system also benefits from efficient encryption and decryption algorithms, which rely on linear algebra operations over finite fields of moderate sizes. The security only relies on rank metric decoding problems, and does not require to hide the structure of a code. Based on the current knowledge, those problems cannot be efficiently solved by a quantum computer. Finally, the proposed scheme admits a failure probability that can be precisely controlled and made as low as possible. |
| Document Type: | report |
| Language: | English |
| Availability: | https://hal.science/hal-02426624 https://hal.science/hal-02426624v1/document https://hal.science/hal-02426624v1/file/1911.13119.pdf |
| Rights: | info:eu-repo/semantics/OpenAccess |
| Accession Number: | edsbas.3D06DB6F |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | We present a rank metric code-based encryption scheme with key and ciphertext sizes comparable to that of isogeny-based cryptography for an equivalent security level. The system also benefits from efficient encryption and decryption algorithms, which rely on linear algebra operations over finite fields of moderate sizes. The security only relies on rank metric decoding problems, and does not require to hide the structure of a code. Based on the current knowledge, those problems cannot be efficiently solved by a quantum computer. Finally, the proposed scheme admits a failure probability that can be precisely controlled and made as low as possible. |
|---|