scientific article
From MaRDI portal
Publication:3360789
zbMath0733.94012MaRDI QIDQ3360789
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (30)
The inapproximability of lattice and coding problems with preprocessing ⋮ Lattice basis reduction: Improved practical algorithms and solving subset sum problems ⋮ A knapsack-based probabilistic encryption scheme ⋮ Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! ⋮ Local Testing of Lattices ⋮ A note on the concrete hardness of the shortest independent vector in lattices ⋮ On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography ⋮ Solving low-density multiple subset sum problems with SVP oracle ⋮ A polynomial time algorithm for GapCVPP in \(l_1\) norm ⋮ Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection ⋮ Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) ⋮ Convex hulls of superincreasing knapsacks and lexicographic orderings ⋮ Lexicographical polytopes ⋮ Preimage selective trapdoor function: how to repair an easy problem ⋮ Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) ⋮ Subset Sum Quantumly in 1.17 n . ⋮ Cryptanalysis of a quadratic knapsack cryptosystem ⋮ Non-injective knapsack public-key cryptosystems ⋮ Quadratic compact knapsack public-key cryptosystem ⋮ LLL: A Tool for Effective Diophantine Approximation ⋮ Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems ⋮ Cryptanalysis of a knapsack-based probabilistic encryption scheme ⋮ Improvements in the analysis of Kannan's CVP algorithm ⋮ Predicting Lattice Reduction ⋮ Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory ⋮ Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms ⋮ Public-Key Cryptographic Primitives Provably as Secure as Subset Sum ⋮ Knapsack problems in groups ⋮ Slide reduction, revisited -- filling the gaps in SVP approximation ⋮ A lattice-based public-key cryptosystem
This page was built for publication:
