Paper 2021/440 Original: eprint.iacr.org/2021/440 ↗
Two modifications for Loidreau's code-based cryptosystem
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2021-04-17: last updated
- 2021-04-06: published
- Short URL
- https://ia.cr/2021/440
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2021/440,
author = {Wenshuo Guo and Fangwei Fu},
title = {Two modifications for Loidreau's code-based cryptosystem},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/440},
year = {2021},
url = {https://eprint.iacr.org/2021/440}
}