Some cryptanalytic and coding-theoretic applications of a soft stern algorithm

Using the class of information set decoding algorithms is the best known way of decoding general codes, i.e. codes that admit no special structure, in the Hamming metric. The Stern algorithm is the origin of the most efficient algorithms in this class. We consider the same decoding problem but for a...

Full description

Saved in:
Bibliographic Details
Published inAdvances in mathematics of communications Vol. 13; no. 4; pp. 559 - 578
Main Authors Guo, Qian, Johansson, Thomas, Mårtensson, Erik, Wagner, Paul Stankovski
Format Journal Article
LanguageEnglish
Published 01.11.2019
Subjects
Computer and Information Sciences
Computer Sciences
Data- och informationsvetenskap (Datateknik)
Datavetenskap (Datalogi)
Natural Sciences
Naturvetenskap
soft stern algorithm
side-channel attacks
information set decoding
Soft decoding
stern algorithm
Online AccessGet full text
ISSN1930-5338
1930-5346
DOI10.3934/amc.2019035

Cover

More Information
Summary:Using the class of information set decoding algorithms is the best known way of decoding general codes, i.e. codes that admit no special structure, in the Hamming metric. The Stern algorithm is the origin of the most efficient algorithms in this class. We consider the same decoding problem but for a channel with soft information. We give a version of the Stern algorithm for a channel with soft information that includes some novel steps of ordering vectors in lists, based on reliability values. We demonstrate how the algorithm constitutes an improvement in some cryptographic and coding theoretic applications. We also indicate how to extend the algorithm to include multiple iterations and soft output values.
ISSN:1930-5338
1930-5346
DOI:10.3934/amc.2019035