Pages that link to "Item:Q3770433"

The following pages link to Solving low-density subset sum problems (Q3770433):

Displaying 46 items.

• Tightly secure signatures from lossy identification schemes (Q315555) (← links)
• Hardness of approximating the closest vector problem with pre-processing (Q430834) (← links)
• Lower bounds of shortest vector lengths in random NTRU lattices (Q477183) (← links)
• Solving exponential diophantine equations using lattice basis reduction algorithms (Q579297) (← links)
• Non-standard approaches to integer programming (Q697562) (← links)
• Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
• Quadratic compact knapsack public-key cryptosystem (Q980333) (← links)
• On Lovász' lattice reduction and the nearest lattice point problem (Q1076512) (← links)
• Algorithms to construct Minkowski reduced and Hermite reduced lattice bases (Q1081304) (← links)
• The existence of simple \(6\text{-}(14,7,4)\) designs (Q1104330) (← links)
• On the IO-complexity and approximation languages (Q1112018) (← 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)
• Simultaneous reduction of a lattice basis and its reciprocal basis (Q1311020) (← links)
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
• Distribution of Hermite's constant and the shortest vector in lattices of dimension two (Q1340684) (← links)
• The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
• The optimal LLL algorithm is still polynomial in fixed dimension. (Q1401288) (← links)
• Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard (Q1608337) (← links)
• A new fully polynomial time approximation scheme for the interval subset sum problem (Q1675574) (← links)
• Simultaneous approximation problems of \(p\)-adic numbers and \(p\)-adic knapsack cryptosystems -- Alice in \(p\)-adic numberland (Q1702094) (← links)
• An improved balanced algorithm for the subset-sum problem (Q1713739) (← 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)
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
• A polynomial-time algorithm for solving the hidden subset sum problem (Q2096513) (← links)
• Search for combinatorial objects using lattice algorithms -- revisited (Q2115837) (← links)
• Obfuscated fuzzy Hamming distance and conjunctions from subset product problems (Q2175905) (← links)
• Moment subset sums over finite fields (Q2302567) (← links)
• Tightly secure signature schemes from the LWE and subset sum assumptions (Q2330120) (← links)
• A note on BDD problems with \(\lambda_2\)-gap (Q2350585) (← links)
• Low-density attack revisited (Q2384011) (← links)
• A knapsack-based probabilistic encryption scheme (Q2384519) (← links)
• Safer parameters for the Chor-Rivest cryptosystem (Q2389473) (← links)
• Solving low-density multiple subset sum problems with SVP oracle (Q2416533) (← links)
• Automated simplification of large symbolic expressions (Q2437298) (← links)
• Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (Q2490259) (← links)
• Lattice points in high-dimensional spheres (Q2639900) (← links)
• Finding Shortest Lattice Vectors in the Presence of Gaps (Q2790044) (← links)
• Balanced Integer Solutions of Linear Equations (Q2926145) (← links)
• La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász (Q3033847) (← links)
• The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem (Q3354469) (← links)
• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum (Q3408206) (← links)
• (Q5075820) (← links)
• Subset Sum Quantumly in 1.17 n . (Q5889072) (← links)
• Generalization of the subset sum problem and cubic forms (Q6039136) (← links)