The following pages link to (Q3360789):
Displaying 31 items.
- Cryptanalysis of a quadratic knapsack cryptosystem (Q552295) (← links)
- Cryptanalysis of a knapsack-based probabilistic encryption scheme (Q730959) (← links)
- A polynomial time algorithm for GapCVPP in \(l_1\) norm (Q893692) (← links)
- Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
- Quadratic compact knapsack public-key cryptosystem (Q980333) (← links)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
- Lexicographical polytopes (Q1707907) (← links)
- Preimage selective trapdoor function: how to repair an easy problem (Q1718474) (← links)
- A lattice-based public-key cryptosystem (Q1854277) (← links)
- The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- A knapsack-based probabilistic encryption scheme (Q2384519) (← links)
- Solving low-density multiple subset sum problems with SVP oracle (Q2416533) (← links)
- Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) (Q2448084) (← links)
- A note on the concrete hardness of the shortest independent vector in lattices (Q2656338) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum (Q3408206) (← links)
- Local Testing of Lattices (Q4565131) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- LLL: A Tool for Effective Diophantine Approximation (Q5188542) (← links)
- Predicting Lattice Reduction (Q5458584) (← links)
- Knapsack problems in groups (Q5496223) (← links)
- Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms (Q5743489) (← links)
- Subset Sum Quantumly in 1.17 n . (Q5889072) (← links)
- Non-injective knapsack public-key cryptosystems (Q5941079) (← links)
- Improvements in the analysis of Kannan's CVP algorithm (Q5964026) (← links)
- Economical convex coverings and applications (Q6583674) (← links)
- Too many hints -- when LLL breaks LWE (Q6604869) (← links)
