Decoding linear codes with high error rate and its impact for LPN security
From MaRDI portal
Publication:1644747
DOI10.1007/978-3-319-79063-3_2zbMATH Open1425.94077OpenAlexW2795305715MaRDI QIDQ1644747FDOQ1644747
Authors: Leif Both, Alexander May 
Publication date: 22 June 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-79063-3_2
Recommendations
- On computing nearest neighbors with applications to decoding of binary linear codes
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Solving LPN using covering codes
- Solving LPN Using Covering Codes
Cited In (32)
- Syndrome Decoding Estimator
- SoK: how (not) to design and implement post-quantum cryptography
- Identifying an unknown code by partial Gaussian elimination
- Statistical decoding 2.0: reducing decoding to LPN
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
- Performance bounds for QC-MDPC codes decoders
- An algorithm for generalized syndrome decoding problem
- On computing nearest neighbors with applications to decoding of binary linear codes
- Hybrid decoding -- classical-quantum trade-offs for information set decoding
- Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures
- Correlated pseudorandomness from expand-accumulate codes
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- The security of the code-based signature scheme based on the Stern identification protocol
- Dual-Ouroboros: an improvement of the McNie scheme
- Revisiting nearest-neighbor-based information set decoding
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- TinyKeys: a new approach to efficient multi-party computation
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Concrete time/memory trade-offs in generalised Stern's ISD algorithm
- Pseudorandom correlation functions from variable-density LPN, revisited
- Low memory attacks on small key CSIDH
- Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- New time-memory trade-offs for subset sum -- improving ISD in theory and practice
- Asymptotics and improvements of sieving for codes
- Reduction from sparse LPN to LPN, dual attack 3.0
- Integer syndrome decoding in the presence of noise
- Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks
- Wave Parameter Selection
- Lower bounds on lattice sieving and information set decoding
- Memory-efficient quantum information set decoding algorithm
This page was built for publication: Decoding linear codes with high error rate and its impact for LPN security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1644747)
