An Improved LPN Algorithm

From MaRDI portal
Publication:3541899

DOI10.1007/11832072_24zbMath1152.94434OpenAlexW1605324412MaRDI QIDQ3541899

Eric Levieil, Pierre-Alain Fouque

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11832072_24




Related Items

On solving LPN using BKW and variants, Implementation and analysisSilver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codesCryptography from Learning Parity with NoiseA survey on fast correlation attacksCoded-BKW: Solving LWE Using Lattice CodesAn Improved BKW Algorithm for LWE with Applications to Cryptography and LatticesMaking the BKW algorithm practical for LWEKey-recovery attacks on \(\mathsf{ASASA}\)Pseudorandom correlation functions from variable-density LPN, revisitedEfficient detection of high probability statistical properties of cryptosystems via surrogate differentiationSolving the learning parity with noise problem using quantum algorithmsOn the asymptotic complexity of solving LWEOptimization of $$\mathsf {LPN}$$ Solving AlgorithmsA non-heuristic approach to time-space tradeoffs and optimizations for BKWDoes the dual-sieve attack on learning with errors even work?Modeling and simulating the sample complexity of solving LWE using BKW-style algorithmsCorrelated pseudorandomness from expand-accumulate codesEfficient authentication from hard learning problemsCorrelated pseudorandomness from the hardness of quasi-abelian decodingHow to Encrypt with the LPN ProblemBKW meets Fourier new algorithms for LPN with sparse paritiesSQUASH – A New MAC with Provable Security Properties for Highly Constrained Devices Such as RFID TagsSolving the learning parity with noise's open questionAgnostic Learning from Tolerant Natural ProofsA new birthday-type algorithm for attacking the fresh re-keying countermeasureCPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPNFast Correlation Attacks: Methods and CountermeasuresOn the complexity of the BKW algorithm on LWEOn the Security of HB# against a Man-in-the-Middle AttackGood Variants of HB +  Are Hard to FindTwo-Round Man-in-the-Middle Security from LPNParallel and concurrent security of the HB and \(HB^{+}\) protocols: Increasing the Security and Efficiency ofSolving LPN using covering codesAlgebraic and Correlation Attacks against Linearly Filtered Non Linear Feedback Shift RegistersCryptography with Auxiliary Input and Trapdoor from Constant-Noise LPNAlgebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum--Kalai--Wasserman AlgorithmTowards efficient LPN-based symmetric encryptionHe gives C-sieves on the CSIDH