Pages that link to "Item:Q1207335"
From MaRDI portal
The following pages link to Improved low-density subset sum algorithms (Q1207335):
Displaying 50 items.
- A semantically secure public key cryptoscheme using bit-pair shadows (Q344780) (← links)
- A provably secure non-iterative hash function resisting birthday attack (Q344781) (← links)
- A public key cryptosystem based on three new provable problems (Q418738) (← links)
- Lower bounds of shortest vector lengths in random NTRU lattices (Q477183) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Asymptotic granularity reduction and its application (Q719278) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Quadratic compact knapsack public-key cryptosystem (Q980333) (← links)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
- A low-space algorithm for the subset-sum problem on GPU (Q1652299) (← links)
- A pseudorandom number generator based on worst-case lattice problems (Q1675485) (← 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)
- Preimage selective trapdoor function: how to repair an easy problem (Q1718474) (← links)
- Solving market split problems with heuristical lattice reduction (Q1761840) (← links)
- Koblitz curve cryptosystems (Q1779327) (← links)
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme (Q1784985) (← links)
- The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← 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)
- Improved broadcast attacks against subset sum problems via lattice oracle (Q2195373) (← links)
- The projection games conjecture and the hardness of approximation of Super-SAT and related problems (Q2237900) (← 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)
- Safer parameters for the Chor-Rivest cryptosystem (Q2389473) (← links)
- Solving low-density multiple subset sum problems with SVP oracle (Q2416533) (← links)
- Finding Shortest Lattice Vectors in the Presence of Gaps (Q2790044) (← links)
- Balanced Integer Solutions of Linear Equations (Q2926145) (← links)
- A New Non-Merkle-Damgård Structural Hash Function with Provable Security (Q3196424) (← links)
- A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security (Q3196425) (← links)
- Lattice Reduction for Modular Knapsack (Q3455505) (← links)
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices (Q3457104) (← links)
- New Definition of Density on Knapsack Cryptosystems (Q3506377) (← links)
- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach (Q3507347) (← links)
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits (Q3600388) (← links)
- On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem (Q3722413) (← links)
- Analysis of PSLQ, an integer relation finding algorithm (Q4221985) (← links)
- Block Reduced Lattice Bases and Successive Minima (Q4325334) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- (Q5075820) (← links)
- (Q5091027) (← links)
- (Q5150541) (← links)
- (Q5150580) (← links)
- An Improved Multi-set Algorithm for the Dense Subset Sum Problem (Q5387614) (← links)
- Non-injective knapsack public-key cryptosystems (Q5941079) (← links)
