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.
Funder
Bundesministerium für Bildung und Forschung
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Software
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Encryption Method Based on Codes;Advances in Cyber-Physical Systems;2024-05-10
2. An Efficient Barrett Reduction Algorithm for Gaussian Integer Moduli;2023 IEEE 30th Symposium on Computer Arithmetic (ARITH);2023-09-04
3. Generic Decoding of Restricted Errors;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25
4. Efficient Reduction Algorithms for Special Gaussian Integer Moduli;2022 IEEE 29th Symposium on Computer Arithmetic (ARITH);2022-09
5. Decoding of Generalized Concatenated Codes Over the One-Lee Error Channel for the McEliece Cryptosystem;2022 IEEE International Symposium on Information Theory (ISIT);2022-06-26