Interleaved Prange: A New Generic Decoder for Interleaved Codes

Porwal, Anmoal; Holzbaur, Lukas; Liu, Hedongliang; Renner, Julian; Wachter-Zeh, Antonia; Weger, Violetta

doi:10.1007/978-3-031-17234-2_4

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Book1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Their security level can be evaluated based on information-set-decoding (ISD) algorithms (see e.g. [16] for an adaptation of Prange's algorithm to interleaved Hamming-metric codes).…”

Section: Introductionmentioning

confidence: 99%

On Decoding High-Order Interleaved Sum-Rank-Metric Codes

Jerkovits

Hörmann

Bartz

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We consider decoding of vertically homogeneous interleaved sum-rank-metric codes with high interleaving order s, that are constructed by stacking s codewords of a single constituent code. We propose a Metzner-Kapturowski-like decoding algorithm that can correct errors of sum-rank weight t ≤ d − 2, where d is the minimum distance of the code, if the interleaving order s ≥ t and the error matrix fulfills a certain rank condition. The proposed decoding algorithm generalizes the Metzner-Kapturowski(-like) decoders in the Hamming metric and the rank metric and has a computational complexity of O max{n 3 , n 2 s} operations in Fqm , where n is the length of the code. The scheme performs linear-algebraic operations only and thus works for any interleaved linear sum-rank-metric code. We show how the decoder can be used to decode high-order interleaved codes in the skew metric. Apart from error control, the proposed decoder allows to determine the security level of code-based cryptosystems based on interleaved sum-rank metric codes.

show abstract

“…Their security level can be evaluated based on information-set-decoding (ISD) algorithms (see e.g. [16] for an adaptation of Prange's algorithm to interleaved Hamming-metric codes).…”

Section: Introductionmentioning

confidence: 99%