Cryptology ePrint Archive: Report 2021/906

Two Public-Key Cryptosystems Based on Expanded Gabidulin Codes

Wenshuo Guo and Fang-Wei Fu

Abstract: This paper presents two public-key cryptosystems based on the so-called expanded Gabidulin codes, which are constructed by expanding Gabidulin codes over the base field. Exploiting the fast decoder of Gabidulin codes, we propose an efficient algorithm to decode these new codes when the noise vector satisfies a certain condition. Additionally, these new codes have an excellent error-correcting capability because of the optimality of their parent Gabidulin codes. Based on different masking techniques, we give two encryption schemes by using expanded Gabidulin codes in the McEliece setting. According to our analysis, these two cryptosystems can both resist the existing structural attacks. Furthermore, our proposals also have an obvious advantage in public-key representation without using the cyclic or quasi-cyclic structure compared to some other code-based cryptosystems. To achieve the security of 256 bits, for instance, a public-key size of 37005 bytes is enough for our first proposal, while around 1044992 bytes are needed for Classic McEliece selected as a candidate of the third round of the NIST PQC project.

Category / Keywords: public-key cryptography / post-quantum cryptography,code-based cryptography

Original Publication (with minor differences): https://arxiv.org/
DOI:
arXiv:2107.01610 [cs.IT]

Date: received 3 Jul 2021, last revised 1 Sep 2021

Contact author: ws_guo at mail nankai edu cn

Available format(s): PDF | BibTeX Citation

Version: 20210901:072104 (All versions of this report)

Short URL: ia.cr/2021/906


[ Cryptology ePrint archive ]