In EDS ansehen

LowMS: a new rank metric code-based KEM without ideal structure.

Gespeichert in:
Bibliographische Detailangaben
Titel: LowMS: a new rank metric code-based KEM without ideal structure.
Autoren: Aragon, Nicolas, Dyseryn, Victor, Gaborit, Philippe, Loidreau, Pierre, Renner, Julian, Wachter-Zeh, Antonia
Quelle: Designs, Codes & Cryptography; Apr2024, Vol. 92 Issue 4, p1075-1093, 19p
Schlagwörter: CRYPTOSYSTEMS, PUBLIC key cryptography, GOVERNMENT accounting
Abstract: We propose and analyze LowMS , a new rank-based key encapsulation mechanism (KEM). The acronym stands for Loidreau with Multiple Syndromes, since our work combines the cryptosystem of Loidreau (presented at PQCrypto 2017) together with the multiple syndromes approach, that allows to reduce parameters by sending several syndromes with the same error support in one ciphertext. Our scheme is designed without using ideal structures. Considering cryptosystems without such an ideal structure, like the FrodoKEM cryptosystem, is important since structure allows to compress objects, but gives reductions to specific problems whose security may potentially be weaker than for unstructured problems. For 128 bits of security, we propose parameters with a public key size of 4.8 KB and a ciphertext size of 1.1 KB. To the best of our knowledge, our scheme is the smallest among all existing unstructured post-quantum lattice or code-based algorithms, when taking into account the sum of the public key size and the ciphertext size. In that sense, our scheme is for instance about 4 times shorter than FrodoKEM. Our system relies on the hardness of the Rank Support Learning problem, a well-known variant of the Rank Syndrome Decoding problem, and on the problem of indistinguishability of distorted Gabidulin codes, i.e., Gabidulin codes multiplied by a homogeneous matrix of given rank. The latter problem was introduced by Loidreau in his paper. [ABSTRACT FROM AUTHOR]
Copyright of Designs, Codes & Cryptography is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Datenbank: Complementary Index
Beschreibung
Abstract:We propose and analyze LowMS , a new rank-based key encapsulation mechanism (KEM). The acronym stands for Loidreau with Multiple Syndromes, since our work combines the cryptosystem of Loidreau (presented at PQCrypto 2017) together with the multiple syndromes approach, that allows to reduce parameters by sending several syndromes with the same error support in one ciphertext. Our scheme is designed without using ideal structures. Considering cryptosystems without such an ideal structure, like the FrodoKEM cryptosystem, is important since structure allows to compress objects, but gives reductions to specific problems whose security may potentially be weaker than for unstructured problems. For 128 bits of security, we propose parameters with a public key size of 4.8 KB and a ciphertext size of 1.1 KB. To the best of our knowledge, our scheme is the smallest among all existing unstructured post-quantum lattice or code-based algorithms, when taking into account the sum of the public key size and the ciphertext size. In that sense, our scheme is for instance about 4 times shorter than FrodoKEM. Our system relies on the hardness of the Rank Support Learning problem, a well-known variant of the Rank Syndrome Decoding problem, and on the problem of indistinguishability of distorted Gabidulin codes, i.e., Gabidulin codes multiplied by a homogeneous matrix of given rank. The latter problem was introduced by Loidreau in his paper. [ABSTRACT FROM AUTHOR]
ISSN:09251022
DOI:10.1007/s10623-023-01330-5