Bounding basis reduction properties

DOI10.1007/S10623-016-0273-9zbMATH Open1430.11092DBLPjournals/dcc/Neumaier17OpenAlexW2296657975WikidataQ59607854 ScholiaQ59607854MaRDI QIDQ2364641FDOQ2364641

Authors: 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

Recommendations

• Publication:2739440
• scientific article; zbMATH DE number 4029654
• scientific article; zbMATH DE number 2159268
• A hierarchy of polynomial time lattice basis reduction algorithms
• scientific article; zbMATH DE number 3958726

zbMATH Keywords

latticesLLL algorithmbasis reductionBKZ algorithm

Mathematics Subject Classification ID

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

Cites Work

• Factoring polynomials with rational coefficients
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• A note on optimal unimodular lattices
• On the distribution of angles between the \(N\) shortest vectors in a random lattice
• The Number of Lattice Points in a Set
• The history of the LLL-algorithm
• Predicting Lattice Reduction
• Title not available (Why is that?)
• The minimum values of positive quadratic forms in six, seven and eight variables
• New upper bounds on sphere packings. I
• The LLL algorithm. Survey and applications
• On the equidistribution of Hecke points
• Block Reduced Lattice Bases and Successive Minima
• Analyzing blockwise lattice algorithms using dynamical systems
• An LLL-reduction algorithm with quasi-linear time complexity
• Algorithmic Number Theory
• Optimality and uniqueness of the Leech lattice among lattices
• Finding short lattice vectors within Mordell's inequality
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on the Hermite-Rankin constant
• Title not available (Why is that?)
• An upper bound on the average number of iterations of the LLL algorithm
• Practical, Predictable Lattice Basis Reduction
• Observation on the Minimum of a Positive Quadratic Form in Eight Variables
• Faster LLL-type Reduction of Lattice Bases
• Rankin’s Constant and Blockwise Lattice Reduction
• Slide reduction, successive minima and several~applications
• Explicit Hard Instances of the Shortest Vector Problem

Cited In (7)

• Improving convergence and practicality of slide-type reductions
• Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
• Slide reduction, revisited -- filling the gaps in SVP approximation
• Sharper bounds on four lattice constants
• The convergence of slide-type reductions
• A complete analysis of the BKZ lattice reduction algorithm
• On the smallest ratio problem of lattice bases

Uses Software

• fpLLL
• GitHub

This page was built for publication: Bounding basis reduction properties

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