On solving LPN using BKW and variants, Implementation and analysis
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 2081058 (Why is no real title available?)
- : Increasing the Security and Efficiency of
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A New Algorithm for Solving Ring-LPN With a Reducible Polynomial
- An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication
- An Algorithm for the Machine Calculation of Complex Fourier Series
- An Improved LPN Algorithm
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Authenticating Pervasive Devices with Human Protocols
- Better algorithms for LWE and LWR
- Classical hardness of learning with errors
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Efficient Authentication from Hard Learning Problems
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- HELEN: a public-key cryptosystem based on the LPN and the decisional minimal distance problems
- IND-CCA secure cryptography based on a variant of the LPN problem
- Lapin: an efficient authentication protocol based on ring-LPN
- Lazy modulus switching for the BKW algorithm on LWE
- Man-in-the-middle secure authentication schemes from LPN and weak PRFs
- Never Trust a Bunny
- New Algorithms for Learning in Presence of Errors
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
- On noise-tolerant learning of sparse parities and related problems
- On the complexity of the BKW algorithm on LWE
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
- Probability Inequalities for Sums of Bounded Random Variables
- Public-key cryptosystems from the worst-case shortest vector problem
- Simple chosen-ciphertext security from low-noise LPN
- Smaller decoding exponents: ball-collision decoding
- Solving LPN Using Covering Codes
Cited in
(24)- Optimization of \(\mathsf {LPN}\) solving algorithms
- A non-heuristic approach to time-space tradeoffs and optimizations for BKW
- The hardness of LPN over any integer ring and field for PCG applications
- Towards efficient LPN-based symmetric encryption
- An iterative correction method for practically LPN solving
- LPN decoded
- On the hardness of sparsely learning parity with noise
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Correlated pseudorandomness from expand-accumulate codes
- Faster algorithms for solving LPN
- Correlated pseudorandomness from the hardness of quasi-abelian decoding
- Solving LPN using covering codes
- A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
- Pseudorandom correlation functions from variable-density LPN, revisited
- A method of evaluating the security of Snow 2.0-like ciphers against correlation attacks over the finite extensions of two element field
- Towards sound fresh re-keying with hard (physical) learning problems
- Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
- On iterative collision search for LPN and subset sum
- Key-recovery attacks on \(\mathsf{ASASA}\)
- Efficient authentication from hard learning problems
- Solving the learning parity with noise problem using quantum algorithms
- BKW meets Fourier new algorithms for LPN with sparse parities
This page was built for publication: On solving LPN using BKW and variants, Implementation and analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q276557)
