Some Cryptanalytic and Coding-Theoretic Applications of a Soft Stern Algorithm

Research output: Contribution to journalArticlepeer-review

Abstract

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.
Original languageEnglish
Pages (from-to)559-578
JournalAdvances in Mathematics of Communications
Volume13
Issue number4
DOIs
Publication statusPublished - 2019

Subject classification (UKÄ)

  • Computer Science

Fingerprint

Dive into the research topics of 'Some Cryptanalytic and Coding-Theoretic Applications of a Soft Stern Algorithm'. Together they form a unique fingerprint.

Cite this