Bounding basis reduction properties

DOI10.1007/s10623-016-0273-9zbMath1430.11092OpenAlexW2296657975WikidataQ59607854 ScholiaQ59607854MaRDI QIDQ2364641

Arnold Neumaier

Publication date: 21 July 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-016-0273-9

zbMATH Keywords

latticesLLL algorithmbasis reductionBKZ algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Quadratic forms (reduction theory, extreme forms, etc.) (11H55)

Related Items (5)

Sharper bounds on four lattice constants ⋮ Improving convergence and practicality of slide-type reductions ⋮ Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation ⋮ The convergence of slide-type reductions ⋮ Slide reduction, revisited -- filling the gaps in SVP approximation

Uses Software

• fpLLL
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the Hermite-Rankin constant
• Optimality and uniqueness of the Leech lattice among lattices
• The LLL algorithm. Survey and applications
• Factoring polynomials with rational coefficients
• A note on optimal unimodular lattices
• An upper bound on the average number of iterations of the LLL algorithm
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• New upper bounds on sphere packings. I
• The minimum values of positive quadratic forms in six, seven and eight variables
• Practical, Predictable Lattice Basis Reduction
• SLIDE REDUCTION, SUCCESSIVE MINIMA AND SEVERAL APPLICATIONS
• Faster LLL-type Reduction of Lattice Bases
• On the distribution of angles between the N shortest vectors in a random lattice
• The Number of Lattice Points in a Set
• Explicit Hard Instances of the Shortest Vector Problem
• Block Reduced Lattice Bases and Successive Minima
• On the equidistribution of Hecke points
• The History of the LLL-Algorithm
• Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
• An LLL-reduction algorithm with quasi-linear time complexity
• Predicting Lattice Reduction
• Rankin’s Constant and Blockwise Lattice Reduction
• Observation on the Minimum of a Positive Quadratic Form in Eight Variables
• Algorithmic Number Theory

This page was built for publication: Bounding basis reduction properties