Pages that link to "Item:Q3722413"
From MaRDI portal
The following pages link to On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem (Q3722413):
Displaying 11 items.
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations (Q1125006) (← links)
- Improved low-density subset sum algorithms (Q1207335) (← links)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme (Q1784985) (← links)
- Tightly secure signature schemes from the LWE and subset sum assumptions (Q2330120) (← links)
- Safer parameters for the Chor-Rivest cryptosystem (Q2389473) (← links)
- Lattice points in high-dimensional spheres (Q2639900) (← links)
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum (Q3408206) (← links)
- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach (Q3507347) (← links)
- Random knapsack in expected polynomial time (Q5917572) (← links)
