A New Class of Q-Ary Codes for the McEliece Cryptosystem
Saved in:
| Title: | A New Class of Q-Ary Codes for the McEliece Cryptosystem |
|---|---|
| Authors: | Jürgen Freudenberger, Johann-Philipp Thiers |
| Source: | Cryptography, Vol 5, Iss 11, p 11 (2021) |
| Publisher Information: | MDPI AG |
| Publication Year: | 2021 |
| Collection: | Directory of Open Access Journals: DOAJ Articles |
| Subject Terms: | public-key cryptography, code-based cryptosystem, McEliece cryptosystem, Gaussian integers, decoding attack, information-set decoding, Technology |
| Description: | The McEliece cryptosystem is a promising candidate for post-quantum public-key encryption. In this work, we propose q -ary codes over Gaussian integers for the McEliece system and a new channel model. With this one Mannheim error channel, errors are limited to weight one. We investigate the channel capacity of this channel and discuss its relation to the McEliece system. The proposed codes are based on a simple product code construction and have a low complexity decoding algorithm. For the one Mannheim error channel, these codes achieve a higher error correction capability than maximum distance separable codes with bounded minimum distance decoding. This improves the work factor regarding decoding attacks based on information-set decoding. |
| Document Type: | article in journal/newspaper |
| Language: | English |
| Relation: | https://www.mdpi.com/2410-387X/5/1/11; https://doaj.org/toc/2410-387X; https://doaj.org/article/53340758c7854554bb80810ce5e4788e |
| DOI: | 10.3390/cryptography5010011 |
| Availability: | https://doi.org/10.3390/cryptography5010011 https://doaj.org/article/53340758c7854554bb80810ce5e4788e |
| Accession Number: | edsbas.41F7DA30 |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | The McEliece cryptosystem is a promising candidate for post-quantum public-key encryption. In this work, we propose q -ary codes over Gaussian integers for the McEliece system and a new channel model. With this one Mannheim error channel, errors are limited to weight one. We investigate the channel capacity of this channel and discuss its relation to the McEliece system. The proposed codes are based on a simple product code construction and have a low complexity decoding algorithm. For the one Mannheim error channel, these codes achieve a higher error correction capability than maximum distance separable codes with bounded minimum distance decoding. This improves the work factor regarding decoding attacks based on information-set decoding. |
|---|---|
| DOI: | 10.3390/cryptography5010011 |