Improved Generic Algorithms for Hard Knapsacks
From MaRDI portal
Publication:3003392
DOI10.1007/978-3-642-20465-4_21zbMath1281.94014MaRDI QIDQ3003392
Jean-Sébastien Coron, Antoine Joux, Anja Becker
Publication date: 27 May 2011
Published in: Advances in Cryptology – EUROCRYPT 2011 (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.6716
Related Items
Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems, Unnamed Item, Unnamed Item, The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound, Subset Sum Quantumly in 1.17 n ., Finding low-weight polynomial multiples using the rho method, Tightly secure signatures from lossy identification schemes, Improved combinatorial algorithms for the inhomogeneous short integer solution problem, Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme, An algorithmic framework for the generalized birthday problem, Efficient dissection of bicomposite problems with cryptanalytic applications, Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation?, Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory, Quantum key search for ternary LWE, A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem, Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms, Quantum security analysis of CSIDH, How to meet ternary LWE keys, MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications, How to find ternary LWE keys using locality sensitive hashing, A new approach for finding low-weight polynomial multiples, Tightly secure signature schemes from the LWE and subset sum assumptions, Improved classical and quantum algorithms for subset-sum, Integer factorization as subset-sum problem, A sieve algorithm based on overlattices, Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory
