Information set decoding with soft information and some cryptographic applications

Guo, Qian; Johansson, Thomas; Mårtensson, Erik; Stankovski, Paul

doi:10.1109/isit.2017.8006838

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

2022

Publication Types

Select...

Article4

Book1

Relationship

Self Cite1

Independent4

Authors

Journals

Cited by 5 publications

(1 citation statement)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the conference version[16], we presented an upper bound on the time complexity of solving this instance, i.e., 31 Gaussian eliminations. After careful simulation, we can now show a more accurate complexity estimation.…”

mentioning

confidence: 99%

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

Guo¹,

Johansson²,

Mårtensson³

et al. 2019

Advances in Mathematics of Communications

Self Cite

View full text Add to dashboard Cite

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.

show abstract

mentioning

confidence: 99%