Some new NP-complete coding problems
From MaRDI portal
Recommendations
Cited in
(21)- Sur la complexité d'un problème de codage
- A zero-knowledge identification scheme based on the \(q\)-ary syndrome decoding problem
- \textsf{FuLeeca}: a Lee-based signature scheme
- Generic error SDP and generic error CVE
- Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems
- The Parametrized Complexity of Some Fundamental Problems in Coding Theory
- On the hardness of the Lee syndrome decoding problem
- DAGS: key encapsulation using dyadic GS codes
- Cryptanalysis of a code-based full-time signature
- SPANSE: combining sparsity with density for efficient one-time code-based digital signatures
- On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
- Interleaved Prange: a new generic decoder for interleaved codes
- \(\mathcal{NP}\)-completeness of the Goppa parameterised random binary quasi-dyadic syndrome decoding problem
- Information set decoding for Lee-metric codes using restricted balls
- A method of protected distribution of data among unreliable and untrusted nodes
- Improved information set decoding algorithms over Galois ring in the Lee metric
- A NP-complete problem in coding theory with application to code based cryptography
- Computing the Stopping Distance of a Tanner Graph Is NP-Hard
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head
- Zero knowledge protocols and signatures from the restricted syndrome decoding problem
- NP-completeness of the random binary quasi-dyadic coset weight problem and the random binary quasi-dyadic subspace weight problem
This page was built for publication: Some new NP-complete coding problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1280761)
