A more efficient algorithm for lattice basis reduction

DOI10.1016/0196-6774(88)90004-1MaRDI QIDQ4711415zbMATH OpenOpenAlexFDO

Authors Claus Peter Schnorr

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

zbMATH Keywords

algorithmcomputational number theoryinteger lattice basisLovasz reduced basis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Quadratic forms (reduction theory, extreme forms, etc.) (11H55) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 3958726
• A hierarchy of polynomial time lattice basis reduction algorithms
• scientific article; zbMATH DE number 4029654
• scientific article; zbMATH DE number 1643923
• Simultaneous reduction of a lattice basis and its reciprocal basis

Cited in

(24)

• A Digital Signature Scheme Based on CVP  ∞
• Practical, Predictable Lattice Basis Reduction
• Analysis of PSLQ, an integer relation finding algorithm
• Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
• Simultaneous reduction of a lattice basis and its reciprocal basis
• Segment LLL reduction of lattice bases using modular arithmetic
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Collision-free hashing from lattice problems
• Simultaneously good bases of a lattice and its reciprocal lattice
• An efficient lattice reduction using reuse technique blockwisely on NTRU
• Lattice Reduction for Modular Knapsack
• scientific article; zbMATH DE number 1643923 (Why is no real title available?)
• Towards a modern LLL implementation
• Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem
• Analytic regression of Feynman integrals from high-precision numerical sampling
• Cryptographic functions from worst-case complexity assumptions
• Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction
• Fast LLL-type lattice reduction
• Faster LLL-type Reduction of Lattice Bases
• Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
• Improved Rounding for Spline Coefficients and Knots
• Improved low-density subset sum algorithms
• Towards faster polynomial-time lattice reduction
• Practical attacks on small private exponent RSA: new records and new insights

This page was built for publication: A more efficient algorithm for lattice basis reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4711415)