Pages that link to "Item:Q2363734"
From MaRDI portal
The following pages link to On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge (Q2363734):
Displaying 13 items.
- Information set decoding in the Lee metric with applications to cryptography (Q825935) (← links)
- DAGS: key encapsulation using dyadic GS codes (Q1755960) (← links)
- Encryption scheme based on expanded Reed-Solomon codes (Q2025358) (← links)
- On the design and security of Lee metric McEliece cryptosystems (Q2115742) (← links)
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
- Information-set decoding with hints (Q2163764) (← links)
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge (Q2693627) (← links)
- Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ (Q5739026) (← links)
- Generalization of the Ball-Collision Algorithm (Q5855596) (← links)
- On the hardness of the Lee syndrome decoding problem (Q6089464) (← links)
- S-semantics -- an example (Q6102251) (← 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)
