A more efficient algorithm for lattice basis reduction
From MaRDI portal
Publication:4711415
DOI10.1016/0196-6774(88)90004-1zbMath0825.11015OpenAlexW2067935912MaRDI QIDQ4711415
Publication date: 25 June 1992
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(88)90004-1
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Number-theoretic algorithms; complexity (11Y16) Quadratic forms (reduction theory, extreme forms, etc.) (11H55)
Related Items
Towards faster polynomial-time lattice reduction, Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction, Lattice basis reduction: Improved practical algorithms and solving subset sum problems, Lattice Reduction for Modular Knapsack, An efficient lattice reduction using reuse technique blockwisely on NTRU, Segment LLL reduction of lattice bases using modular arithmetic, Simultaneously good bases of a lattice and its reciprocal lattice, Practical attacks on small private exponent RSA: new records and new insights, Gradual sub-lattice reduction and a new complexity for factoring polynomials, Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages, Improved low-density subset sum algorithms, Improved Rounding for Spline Coefficients and Knots, Fast LLL-type lattice reduction, Cryptographic Functions from Worst-Case Complexity Assumptions, A Digital Signature Scheme Based on CVP ∞, Collision-Free Hashing from Lattice Problems, Analysis of PSLQ, an integer relation finding algorithm, Simultaneous reduction of a lattice basis and its reciprocal basis
