You are looking at a specific version 20210406:072818 of this paper. See the latest version.

Paper 2021/440

Two modifications for Loidreau's code-based cryptosystem

Wenshuo Guo and Fangwei Fu

Abstract

This paper presents two modifications for Loidreau’s code-based cryptosystem. Loidreau’s cryptosystem is a rank metric code-based cryptosystem constructed by using Gabidulin codes in the McEliece setting. Recently a polynomial-time key recovery attack was proposed to break Loidreau’s cryptosystem in some cases. To prevent this attack, we propose the use of subcodes to disguise the secret codes in Modification I. In Modification II, we choose a random matrix of low column rank over F q to mix with the secret matrix. According to our analysis, these two modifications can both resist the existing structural attacks. Additionally, we adopt the systematic generator matrix of the public code to make a reduction in the public-key size. In additon to stronger resistance against structural attacks and more compact representation of public keys, our modifications also have larger information transmission rates.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. https://arxiv.org/
Keywords
public-key cryptography
Contact author(s)
ws_guo @ mail nankai edu cn
History
2021-04-17: last of 2 revisions
2021-04-06: received
See all versions
Short URL
https://ia.cr/2021/440
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.