A New Class of Q-Ary Codes for the McEliece Cryptosystem
Copyright policy )A New Class of Q-Ary Codes for the McEliece Cryptosystem
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.
ddc:004, Gaussian integers, decoding attack, Technology, code-based cryptosystem, T, public-key cryptography, information-set decoding, 004, 620, McEliece cryptosystem
ddc:004, Gaussian integers, decoding attack, Technology, code-based cryptosystem, T, public-key cryptography, information-set decoding, 004, 620, McEliece cryptosystem
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).12 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!