On solving LPN using BKW and variants, Implementation and analysis
From MaRDI portal
Publication:276557
DOI10.1007/s12095-015-0149-2zbMath1338.94068OpenAlexW1052697673WikidataQ116754355 ScholiaQ116754355MaRDI QIDQ276557
Serge Vaudenay, Sonia Bogos, Florian Tramèr
Publication date: 4 May 2016
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-015-0149-2
Related Items (17)
Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions ⋮ Key-recovery attacks on \(\mathsf{ASASA}\) ⋮ Pseudorandom correlation functions from variable-density LPN, revisited ⋮ Solving the learning parity with noise problem using quantum algorithms ⋮ A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels ⋮ Optimization of $$\mathsf {LPN}$$ Solving Algorithms ⋮ 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 ⋮ Efficient authentication from hard learning problems ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ BKW meets Fourier new algorithms for LPN with sparse parities ⋮ A method of evaluating the security of Snow 2.0-like ciphers against correlation attacks over the finite extensions of two element field ⋮ Solving LPN using covering codes ⋮ Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions ⋮ Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems
Cites Work
- Unnamed Item
- Unnamed Item
- On the complexity of the BKW algorithm on LWE
- Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs
- Never Trust a Bunny
- Solving LPN Using Covering Codes
- Better Algorithms for LWE and LWR
- A New Algorithm for Solving Ring-LPN With a Reducible Polynomial
- Efficient Authentication from Hard Learning Problems
- New Algorithms for Learning in Presence of Errors
- On Noise-Tolerant Learning of Sparse Parities and Related Problems
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- An Improved LPN Algorithm
- Lapin: An Efficient Authentication Protocol Based on Ring-LPN
- IND-CCA Secure Cryptography Based on a Variant of the LPN Problem
- HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems
- Public-key cryptosystems from the worst-case shortest vector problem
- Smaller Decoding Exponents: Ball-Collision Decoding
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Probability Inequalities for Sums of Bounded Random Variables
- Simple Chosen-Ciphertext Security from Low-Noise LPN
- Lazy Modulus Switching for the BKW Algorithm on LWE
- Authenticating Pervasive Devices with Human Protocols
- An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication
- : Increasing the Security and Efficiency of
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Classical hardness of learning with errors
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
This page was built for publication: On solving LPN using BKW and variants, Implementation and analysis
