Pages that link to "Item:Q3986470"
From MaRDI portal
The following pages link to The complexity of information set decoding (Q3986470):
Displaying 14 items.
- Information set decoding in the Lee metric with applications to cryptography (Q825935) (← links)
- New approaches to reduced-complexity decoding (Q1180151) (← links)
- Generalized information-set decoding of \((L,g)\)-codes (Q1337936) (← links)
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
- Information-set decoding with hints (Q2163764) (← links)
- Some cryptanalytic and coding-theoretic applications of a soft Stern algorithm (Q2274236) (← links)
- Information sets in abelian codes: defining sets and Groebner basis (Q2436565) (← links)
- On the complexity of suboptimal decoding for list and decision feedback schemes (Q2489924) (← links)
- Code-Based Cryptosystems Using Generalized Concatenated Codes (Q4610024) (← links)
- (Q4893148) (← links)
- Time-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary Codes (Q5087252) (← links)
- Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ (Q5739026) (← links)
- An algorithm for generalized syndrome decoding problem (Q6112190) (← links)
- Improved information set decoding algorithms over Galois ring in the Lee metric (Q6131036) (← links)
