Low Weight Discrete Logarithm and Subset Sum in 20.65n with Polynomial Memory
Andre Esser, Alexander May
2020年份
14被引次数
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper，每个回答都会注明依据哪几篇。
相关 Paper
- Memory-Sample Lower Bounds for LWEMingqi Lu, Junzhao YangCRYPTO 2024 · 被引用 1 次
- 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 次
- 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 次
