LPN decoded
From MaRDI portal
Publication:1680226
DOI10.1007/978-3-319-63715-0_17zbMath1410.94065OpenAlexW4251261743MaRDI QIDQ1680226
Andre Esser, Alexander May, Robert Kübler
Publication date: 15 November 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-63715-0_17
Related Items (20)
Noisy Simon period finding ⋮ Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Exploring crypto dark matter: new simple PRF candidates and their applications ⋮ Making the BKW algorithm practical for LWE ⋮ Syndrome Decoding Estimator ⋮ Pseudorandom correlation functions from variable-density LPN, revisited ⋮ Efficient detection of high probability statistical properties of cryptosystems via surrogate differentiation ⋮ New time-memory trade-offs for subset sum -- improving ISD in theory and practice ⋮ A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions ⋮ Solving the learning parity with noise problem using quantum algorithms ⋮ Non-interactive secure computation of inner-product from LPN and LWE ⋮ A non-heuristic approach to time-space tradeoffs and optimizations for BKW ⋮ Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions ⋮ Solving LPN using covering codes ⋮ Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory ⋮ Dummy shuffling against algebraic attacks in white-box implementations ⋮ Large scale, actively secure computation from LPN and free-XOR garbled circuits
This page was built for publication: LPN decoded
