Pages that link to "Item:Q5479385"
From MaRDI portal
The following pages link to Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479385):
Displaying 36 items.
- On solving LPN using BKW and variants, Implementation and analysis (Q276557) (← links)
- The extended \(k\)-tree algorithm (Q431783) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem (Q1715853) (← links)
- Solving systems of linear Boolean equations with noisy right-hand sides over the reals (Q1744342) (← links)
- CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN (Q1981773) (← links)
- An improved algorithm for learning sparse parities in the presence of noise (Q2034402) (← links)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- Towards efficient LPN-based symmetric encryption (Q2117050) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
- Cryptanalysis of a hash function, and the modular subset sum problem (Q2304868) (← links)
- Asymptotically efficient lattice-based digital signatures (Q2413615) (← links)
- Quantum learning Boolean linear functions w.r.t. product distributions (Q2677243) (← links)
- Improved classical and quantum algorithms for subset-sum (Q2692398) (← links)
- BKW meets Fourier new algorithms for LPN with sparse parities (Q2697880) (← links)
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem (Q2796401) (← links)
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN (Q2835589) (← links)
- Constructing Carmichael numbers through improved subset-product algorithms (Q2871190) (← links)
- Cryptography from Learning Parity with Noise (Q2891361) (← links)
- Optimization of $$\mathsf {LPN}$$ Solving Algorithms (Q2958144) (← links)
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum (Q3408206) (← links)
- Algebraic and Correlation Attacks against Linearly Filtered Non Linear Feedback Shift Registers (Q3644200) (← links)
- Quantum machine learning: a classical perspective (Q4556858) (← links)
- Some Recent Results on Local Testing of Sparse Linear Codes (Q4933384) (← links)
- Agnostic Learning from Tolerant Natural Proofs (Q5002638) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- An Improved Multi-set Algorithm for the Dense Subset Sum Problem (Q5387614) (← links)
- Improved Algorithms for the Approximate k-List Problem in Euclidean Norm (Q5738781) (← links)
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols (Q5962225) (← links)
- A non-heuristic approach to time-space tradeoffs and optimizations for BKW (Q6135457) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)
- Spherical Gaussian leftover hash lemma via the Rényi divergence (Q6535100) (← links)
- A systematic study of sparse LWE (Q6652897) (← links)
