A polynomial-time algorithm for solving the hidden subset sum problem
From MaRDI portal
Publication:2096513
DOI10.1007/978-3-030-56880-1_1zbMath1504.94126OpenAlexW3021630508MaRDI QIDQ2096513
Jean-Sébastien Coron, Agnese Gini
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_1
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Lovász' lattice reduction and the nearest lattice point problem
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- Improved low-density subset sum algorithms
- A polynomial-time algorithm for solving the hidden subset sum problem
- On Kilian's randomization of multilinear map encodings
- Cryptanalysis of CLT13 multilinear maps with independent slots
- Practical Multilinear Maps over the Integers
- BKZ 2.0: Better Lattice Security Estimates
- Cryptanalysis of the Co-ACD Assumption
- Fully Homomorphic Encryption over the Integers
- An LLL Algorithm with Quadratic Complexity
- Solving low-density subset sum problems
- Using Algebraic Geometry
- Fault Attacks Against emv Signatures
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- Advances in Cryptology - EUROCRYPT 2004
This page was built for publication: A polynomial-time algorithm for solving the hidden subset sum problem
