Optimization of $$\mathsf {LPN}$$ Solving Algorithms
From MaRDI portal
Publication:2958144
DOI10.1007/978-3-662-53887-6_26zbMath1404.94042OpenAlexW2549949990MaRDI QIDQ2958144
Publication date: 1 February 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53887-6_26
Related Items (10)
Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Pseudorandom correlation functions from variable-density LPN, revisited ⋮ Solving the learning parity with noise problem using quantum 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 ⋮ Solving LPN using covering codes ⋮ Towards efficient LPN-based symmetric encryption
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On solving LPN using BKW and variants, Implementation and analysis
- On probability of success in linear and differential cryptanalysis
- How to Sequentialize Independent Parallel Attacks?
- Faster Algorithms for Solving LPN
- Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs
- Never Trust a Bunny
- Solving LPN Using Covering Codes
- Efficient Authentication from Hard Learning Problems
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- How to Encrypt with the LPN Problem
- An Improved LPN Algorithm
- Quasi-Perfect Codes With Small Distance
- Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions
- On the covering radius of codes
- Covering radius---Survey and recent results
- 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
- Simple Chosen-Ciphertext Security from Low-Noise LPN
- 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
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Optimization of $$\mathsf {LPN}$$ Solving Algorithms
