Pages that link to "Item:Q6175988"
From MaRDI portal
The following pages link to Statistical decoding 2.0: reducing decoding to LPN (Q6175988):
Displaying 13 items.
- Statistical Pruning for Near-Maximum Likelihood Decoding (Q4564624) (← links)
- Statistical Decoding Revisited (Q5757720) (← links)
- Statistical decoding 2.0: reducing decoding to LPN (Q6175988) (← links)
- Memory-efficient quantum information set decoding algorithm (Q6535497) (← links)
- Rigorous foundations for dual attacks in coding theory (Q6587944) (← links)
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography (Q6595926) (← links)
- Revisiting nearest-neighbor-based information set decoding (Q6595933) (← links)
- Zero knowledge protocols and signatures from the restricted syndrome decoding problem (Q6635771) (← links)
- The hardness of LPN over any integer ring and field for PCG applications (Q6637566) (← links)
- Asymptotics and improvements of sieving for codes (Q6637718) (← links)
- Reduction from sparse LPN to LPN, dual attack 3.0 (Q6637725) (← links)
- CryptAttackTester: high-assurance attack analysis (Q6652984) (← links)
- Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks (Q6652985) (← links)