Fast LLL-type lattice reduction
type: Item
instance of: scholarly article
title: Fast LLL-type lattice reduction
zbMATH Open document ID: 1108.11090
published in: Information and Computation
publication date: 2006-04-28T00:00:00Z
full work available at URL: http://nbn-resolving.de/urn/resolver.pl
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11H06
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 5021202
zbMATH Keywords: LLL-reduction
zbMATH Keywords: SLLL-reduction
zbMATH Keywords: Length defect
zbMATH Keywords: Segments
zbMATH Keywords: Local LLL-reduction
zbMATH Keywords: Householder reflection
zbMATH Keywords: Floating point errors
zbMATH Keywords: QR-decomposition
author: Claus Peter Schnorr
describes a project that uses: NTL
MaRDI profile type: Publication
OpenAlex ID: W2031600610
cites work: Q4542515
cites work: The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice
cites work: A sieve algorithm for the shortest lattice vector problem
cites work: Random lattices, threshold phenomena and efficient reduction algorithms.
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Q3374898
cites work: On the complexity of computing short linearly independent vectors and short bases in a lattice
cites work: Finding smooth integers in short intervals using CRT decoding
cites work: Small solutions to polynomial equations, and low exponent RSA vulnerabilities
cites work: Q4787196
cites work: An upper bound on the average number of iterations of the LLL algorithm
cites work: Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
cites work: Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
cites work: Minkowski's Convex Body Theorem and Integer Programming
cites work: Q4787200
cites work: Q4787201
cites work: Integer Programming with a Fixed Number of Variables
cites work: Q4879581
cites work: Factoring polynomials with rational coefficients
cites work: Q3745276
cites work: The shortest vector in a lattice is hard to approximate to within some constant
cites work: Q4787204
cites work: Q4829810
cites work: Segment LLL reduction of lattice bases using modular arithmetic
cites work: Q2739436
cites work: Floating-Point LLL Revisited
cites work: A hierarchy of polynomial time lattice basis reduction algorithms
cites work: A more efficient algorithm for lattice basis reduction
cites work: Q4266548
cites work: Q4418644
cites work: Q5599376
DOI: 10.1016/J.IC.2005.04.004
description: scientific article