Pages that link to "Item:Q276557"
From MaRDI portal
The following pages link to On solving LPN using BKW and variants, Implementation and analysis (Q276557):
Displaying 19 items.
- On the hardness of sparsely learning parity with noise (Q1616883) (← links)
- LPN decoded (Q1680226) (← links)
- On iterative collision search for LPN and subset sum (Q1690294) (← links)
- Efficient authentication from hard learning problems (Q1698400) (← links)
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions (Q2061985) (← links)
- Towards efficient LPN-based symmetric encryption (Q2117050) (← links)
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions (Q2161418) (← links)
- A method of evaluating the security of Snow 2.0-like ciphers against correlation attacks over the finite extensions of two element field (Q2215268) (← links)
- Solving LPN using covering codes (Q2303453) (← links)
- Key-recovery attacks on \(\mathsf{ASASA}\) (Q2413617) (← links)
- BKW meets Fourier new algorithms for LPN with sparse parities (Q2697880) (← links)
- Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems (Q2829218) (← links)
- Optimization of $$\mathsf {LPN}$$ Solving Algorithms (Q2958144) (← links)
- Solving the learning parity with noise problem using quantum algorithms (Q6103086) (← links)
- A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels (Q6113961) (← links)
- A non-heuristic approach to time-space tradeoffs and optimizations for BKW (Q6135457) (← links)
- Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms (Q6159444) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)
