Pages that link to "Item:Q1280761"
From MaRDI portal
The following pages link to Some new NP-complete coding problems (Q1280761):
Displaying 17 items.
- On covering problems of codes (Q675858) (← links)
- \(\mathcal{NP}\)-completeness of the Goppa parameterised random binary quasi-dyadic syndrome decoding problem (Q725962) (← links)
- DAGS: key encapsulation using dyadic GS codes (Q1755960) (← links)
- Cryptanalysis of a code-based full-time signature (Q1981793) (← links)
- A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem (Q3084253) (← links)
- Sur la complexité d'un problème de codage (Q3755359) (← links)
- A Method of Protected Distribution of Data Among Unreliable and Untrusted Nodes (Q5113873) (← links)
- On the hardness of the Lee syndrome decoding problem (Q6089464) (← links)
- Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems (Q6112240) (← links)
- Improved information set decoding algorithms over Galois ring in the Lee metric (Q6131036) (← links)
- Information set decoding for Lee-metric codes using restricted balls (Q6174647) (← links)
- On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography (Q6487414) (← links)
- \textsf{FuLeeca}: a Lee-based signature scheme (Q6550578) (← links)
- Generic error SDP and generic error CVE (Q6550584) (← links)
- SPANSE: combining sparsity with density for efficient one-time code-based digital signatures (Q6580201) (← links)
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head (Q6635752) (← links)
- Zero knowledge protocols and signatures from the restricted syndrome decoding problem (Q6635771) (← links)
