The following pages link to An Improved LPN Algorithm (Q3541899):
Displaying 35 items.
- On solving LPN using BKW and variants, Implementation and analysis (Q276557) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- Efficient authentication from hard learning problems (Q1698400) (← links)
- A new birthday-type algorithm for attacking the fresh re-keying countermeasure (Q1739216) (← links)
- CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN (Q1981773) (← links)
- Towards efficient LPN-based symmetric encryption (Q2117050) (← links)
- He gives C-sieves on the CSIDH (Q2119021) (← links)
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
- Making the BKW algorithm practical for LWE (Q2152043) (← links)
- On the complexity of the BKW algorithm on LWE (Q2256097) (← links)
- Solving LPN using covering codes (Q2303453) (← links)
- A survey on fast correlation attacks (Q2376656) (← links)
- Key-recovery attacks on \(\mathsf{ASASA}\) (Q2413617) (← links)
- Solving the learning parity with noise's open question (Q2444770) (← links)
- BKW meets Fourier new algorithms for LPN with sparse parities (Q2697880) (← links)
- Two-Round Man-in-the-Middle Security from LPN (Q2796127) (← links)
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN (Q2835589) (← links)
- Cryptography from Learning Parity with Noise (Q2891361) (← links)
- Optimization of $$\mathsf {LPN}$$ Solving Algorithms (Q2958144) (← links)
- Fast Correlation Attacks: Methods and Countermeasures (Q3013077) (← links)
- Coded-BKW: Solving LWE Using Lattice Codes (Q3457103) (← links)
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices (Q3457104) (← links)
- How to Encrypt with the LPN Problem (Q3519542) (← links)
- SQUASH – A New MAC with Provable Security Properties for Highly Constrained Devices Such as RFID Tags (Q3525666) (← links)
- On the Security of HB# against a Man-in-the-Middle Attack (Q3600368) (← links)
- Good Variants of HB + Are Hard to Find (Q3603007) (← links)
- Algebraic and Correlation Attacks against Linearly Filtered Non Linear Feedback Shift Registers (Q3644200) (← links)
- Algebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum--Kalai--Wasserman Algorithm (Q5001674) (← links)
- Agnostic Learning from Tolerant Natural Proofs (Q5002638) (← links)
- : Increasing the Security and Efficiency of (Q5458602) (← links)
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols (Q5962225) (← links)
- Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms (Q6159444) (← links)
- An iterative correction method for practically LPN solving (Q6576954) (← links)
- Asymptotics and improvements of sieving for codes (Q6637718) (← links)
- Reduction from sparse LPN to LPN, dual attack 3.0 (Q6637725) (← links)
