Pages that link to "Item:Q3003392"
From MaRDI portal
The following pages link to Improved Generic Algorithms for Hard Knapsacks (Q3003392):
Displayed 26 items.
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem (Q1715853) (← links)
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme (Q1784985) (← links)
- An algorithmic framework for the generalized birthday problem (Q1999907) (← links)
- Efficient dissection of bicomposite problems with cryptanalytic applications (Q2010595) (← links)
- Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation? (Q2023309) (← links)
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
- Quantum key search for ternary LWE (Q2118530) (← links)
- A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem (Q2118564) (← links)
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms (Q2119016) (← links)
- Quantum security analysis of CSIDH (Q2119022) (← links)
- How to meet ternary LWE keys (Q2128581) (← links)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications (Q2139646) (← links)
- How to find ternary LWE keys using locality sensitive hashing (Q2149799) (← links)
- A new approach for finding low-weight polynomial multiples (Q2151296) (← links)
- Tightly secure signature schemes from the LWE and subset sum assumptions (Q2330120) (← links)
- Improved classical and quantum algorithms for subset-sum (Q2692398) (← links)
- Integer factorization as subset-sum problem (Q2700674) (← links)
- A sieve algorithm based on overlattices (Q2878827) (← links)
- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory (Q3452571) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- (Q5009597) (← links)
- The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound (Q5041235) (← links)
- (Q5075820) (← links)
- Subset Sum Quantumly in 1.17 n . (Q5889072) (← links)
- Finding low-weight polynomial multiples using the rho method (Q6103104) (← links)