Pages that link to "Item:Q1644747"
From MaRDI portal
The following pages link to Decoding linear codes with high error rate and its impact for LPN security (Q1644747):
Displaying 26 items.
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- Identifying an unknown code by partial Gaussian elimination (Q1727382) (← links)
- Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures (Q2055702) (← links)
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms (Q2119016) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
- Performance bounds for QC-MDPC codes decoders (Q2163766) (← links)
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD (Q2170098) (← links)
- Dual-Ouroboros: an improvement of the McNie scheme (Q2176294) (← links)
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge (Q2693627) (← links)
- Syndrome Decoding Estimator (Q5087253) (← links)
- The security of the code-based signature scheme based on the Stern identification protocol (Q5871430) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
- Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes (Q6057208) (← links)
- Hybrid decoding -- classical-quantum trade-offs for information set decoding (Q6111571) (← links)
- An algorithm for generalized syndrome decoding problem (Q6112190) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)
- Statistical decoding 2.0: reducing decoding to LPN (Q6175988) (← links)
- Low memory attacks on small key CSIDH (Q6535121) (← links)
- Memory-efficient quantum information set decoding algorithm (Q6535497) (← links)
- Revisiting nearest-neighbor-based information set decoding (Q6595933) (← links)
- Concrete time/memory trade-offs in generalised Stern's ISD algorithm (Q6623311) (← links)
- Asymptotics and improvements of sieving for codes (Q6637718) (← links)
- Reduction from sparse LPN to LPN, dual attack 3.0 (Q6637725) (← links)
- Integer syndrome decoding in the presence of noise (Q6643248) (← links)
- Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks (Q6652985) (← links)
