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_2zbMath1425.94077OpenAlexW2795305715MaRDI QIDQ1644747
Publication date: 22 June 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-79063-3_2
Related Items (21)
SoK: how (not) to design and implement post-quantum cryptography ⋮ Lower bounds on lattice sieving and information set decoding ⋮ Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Performance bounds for QC-MDPC codes decoders ⋮ McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD ⋮ Syndrome Decoding Estimator ⋮ Dual-Ouroboros: an improvement of the McNie scheme ⋮ Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes ⋮ Pseudorandom correlation functions from variable-density LPN, revisited ⋮ New time-memory trade-offs for subset sum -- improving ISD in theory and practice ⋮ Hybrid decoding -- classical-quantum trade-offs for information set decoding ⋮ An algorithm for generalized syndrome decoding problem ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ Statistical decoding 2.0: reducing decoding to LPN ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge ⋮ Identifying an unknown code by partial Gaussian elimination ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures ⋮ The security of the code-based signature scheme based on the Stern identification protocol ⋮ Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms
This page was built for publication: Decoding linear codes with high error rate and its impact for LPN security
