Solving LPN using covering codes
From MaRDI portal
Publication:2303453
Recommendations
Cites work
- : Increasing the Security and Efficiency of
- A New Algorithm for Solving Ring-LPN With a Reducible Polynomial
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- An Improved LPN Algorithm
- Authenticating Pervasive Devices with Human Protocols
- Coded-BKW with sieving
- Coded-BKW: solving LWE using lattice codes
- Efficient Authentication from Hard Learning Problems
- Faster algorithms for solving LPN
- HELEN: a public-key cryptosystem based on the LPN and the decisional minimal distance problems
- How to Encrypt with the LPN Problem
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- scientific article; zbMATH DE number 2081058 (Why is no real title available?)
- Lapin: an efficient authentication protocol based on ring-LPN
- Lazy modulus switching for the BKW algorithm on LWE
- LPN decoded
- Memoryless near-collisions via coding theory
- Memoryless near-collisions, revisited
- Message authentication, revisited
- Never Trust a Bunny
- Noise-tolerant learning, the parity problem, and the statistical query model
- On probability of success in linear and differential cryptanalysis
- On solving LPN using BKW and variants, Implementation and analysis
- Optimization of \(\mathsf {LPN}\) solving algorithms
- Parallel and Concurrent Security of the HB and HB + Protocols
- Solving LPN Using Covering Codes
Cited in
(21)- Decoding linear codes with high error rate and its impact for LPN security
- LPN decoded
- On iterative collision search for LPN and subset sum
- Making the BKW algorithm practical for LWE
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
- On solving LPN using BKW and variants, Implementation and analysis
- Faster algorithms for solving LPN
- Solving LPN Using Covering Codes
- Optimization of \(\mathsf {LPN}\) solving algorithms
- Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
- Pseudorandom correlation functions from variable-density LPN, revisited
- Upper bounds on the length function for covering codes with covering radius R and codimension tR+1
- 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
- An iterative correction method for practically LPN solving
- Reduction from sparse LPN to LPN, dual attack 3.0
- Vectorial fast correlation attacks
- Attacks on Goldreich's pseudorandom generators by grouping and solving
- A BKW-style solver for the restricted syndrome decoding problem
This page was built for publication: Solving LPN using covering codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2303453)
