Some new NP-complete coding problems
From MaRDI portal
Publication:1280761
zbMath0913.94009MaRDI QIDQ1280761
Publication date: 13 June 1999
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items (9)
On the hardness of the Lee syndrome decoding problem ⋮ Interleaved Prange: a new generic decoder for interleaved codes ⋮ Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems ⋮ Improved information set decoding algorithms over Galois ring in the Lee metric ⋮ Information set decoding for Lee-metric codes using restricted balls ⋮ A Method of Protected Distribution of Data Among Unreliable and Untrusted Nodes ⋮ Cryptanalysis of a code-based full-time signature ⋮ DAGS: key encapsulation using dyadic GS codes ⋮ A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
This page was built for publication: Some new NP-complete coding problems
