An iterative correction method for practically LPN solving
From MaRDI portal
Publication:6576954
Recommendations
Cites work
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 2081058 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- : Increasing the Security and Efficiency of
- A toolkit for ring-LWE cryptography
- An Improved LPN Algorithm
- Authenticating Pervasive Devices with Human Protocols
- Collision resistant hashing from sub-exponential learning parity with noise
- Commitments and efficient zero-knowledge proofs from learning parity with noise
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Dissection-BKW
- Efficient Authentication from Hard Learning Problems
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on 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
- How to use metaheuristics for design of symmetric-key primitives
- LPN decoded
- Lapin: an efficient authentication protocol based on ring-LPN
- Man-in-the-middle secure authentication schemes from LPN and weak PRFs
- Message authentication, revisited
- More on average case vs approximation complexity
- New lattice-based cryptographic constructions
- Noise-tolerant learning, the parity problem, and the statistical query model
- Optimization of \(\mathsf {LPN}\) solving algorithms
- Parallel and Concurrent Security of the HB and HB + Protocols
- Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties
- S-box pipelining using genetic algorithms for high-throughput AES implementations: how fast can we go?
- Security bounds for the design of code-based cryptosystems
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
- Solving LPN Using Covering Codes
- Solving LPN using covering codes
- Universally composable oblivious transfer based on a variant of LPN
- Worst-case hardness for LPN and cryptographic hashing via code smoothing
This page was built for publication: An iterative correction method for practically LPN solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6576954)
