Volltext-Downloads (blau) und Frontdoor-Views (grau)
  • search hit 8 of 103
Back to Result List

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.

Download full text files

Export metadata

Additional Services

Search Google Scholar

Statistics

frontdoor_oas
Metadaten
Author:Jürgen FreudenbergerORCiDGND, Johann-Philipp ThiersORCiD
URN:urn:nbn:de:bsz:kon4-opus4-29762
DOI:https://doi.org/10.3390/cryptography5010011
ISSN:2410-387X
Parent Title (English):Cryptography
Volume:5
Publisher:MDPI
Place of publication:Basel
Document Type:Article
Language:English
Year of Publication:2021
Release Date:2022/01/10
Tag:Public-key cryptography; Code-based cryptosystem; McEliece cryptosystem; Gaussian integers; Decoding attack; Information-set decoding
Issue:1
Page Number:14
Article Number:11
Note:
Corresponding author: Jürgen Freudenberger
Institutes:Institut für Systemdynamik - ISD
DDC functional group:004 Informatik
Open Access?:Ja
Relevance:Peer reviewed Publikation in Master Journal List
Licence (German):License LogoCreative Commons - CC BY - Namensnennung 4.0 International