Some Cryptanalytic and Coding-Theoretic Applications of a Soft Stern Algorithm
(2019) In Advances in Mathematics of Communications 13(4). p.559-578- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/ca1fde31-6045-4ffc-9479-4a68d00f8757
- author
- Guo, Qian LU ; Johansson, Thomas LU ; Mårtensson, Erik LU and Stankovski, Paul LU
- organization
- publishing date
- 2019
- type
- Contribution to journal
- publication status
- published
- subject
- in
- Advances in Mathematics of Communications
- volume
- 13
- issue
- 4
- pages
- 559 - 578
- publisher
- AIMS
- external identifiers
-
- scopus:85070909364
- ISSN
- 1930-5346
- DOI
- 10.3934/amc.2019035
- language
- English
- LU publication?
- yes
- id
- ca1fde31-6045-4ffc-9479-4a68d00f8757
- date added to LUP
- 2019-03-13 13:23:21
- date last changed
- 2024-01-15 15:54:03
@article{ca1fde31-6045-4ffc-9479-4a68d00f8757, 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.}}, author = {{Guo, Qian and Johansson, Thomas and Mårtensson, Erik and Stankovski, Paul}}, issn = {{1930-5346}}, language = {{eng}}, number = {{4}}, pages = {{559--578}}, publisher = {{AIMS}}, series = {{Advances in Mathematics of Communications}}, title = {{Some Cryptanalytic and Coding-Theoretic Applications of a Soft Stern Algorithm}}, url = {{http://dx.doi.org/10.3934/amc.2019035}}, doi = {{10.3934/amc.2019035}}, volume = {{13}}, year = {{2019}}, }