Low Weight Discrete Logarithm and Subset Sum in 20.65n with Polynomial Memory
Andre Esser, Alexander May
2020Year
14Citations
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get b0f34a5b-ea94-41e3-be1c-5978e43e63f9Related papers
- Memory-Sample Lower Bounds for LWEMingqi Lu, Junzhao YangCRYPTO 2024 · 1 citation
- Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal vectorsJesper Nederlof, Karol WegrzyckiSTOC 2021
- Lattice-Based Succinct Arguments from Vanishing Polynomials - (Extended Abstract)Valerio Cini, Russell W. F. Lai, Giulio MalavoltaCRYPTO 2023 · 38 citations
- Adaptively Secure, Universally Composable Distributed Generation of Discrete-Logarithm Based Keys from Standard AssumptionsHanna Ek, Kelsey Melissaris, Lawrence RoyCRYPTO 2026
- Low-Bandwidth Mixed Arithmetic in VOLE-Based ZK from Low-Degree PRGsAmit Agarwal, Carsten Baum, Lennart Braun, Peter SchollEUROCRYPT 2025 · 2 citations
