Bounding basis reduction properties

DOI10.1007/S10623-016-0273-9MaRDI QIDQ2364641zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Arnold Neumaier

Publication date 21 July 2017

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

latticesLLL algorithmbasis reductionBKZ algorithm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1643923
• 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

Cites work

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

Cited in

(9)

• Improving convergence and practicality of slide-type reductions
• Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
• Towards a modern LLL implementation
• Slide reduction, revisited -- filling the gaps in SVP approximation
• Sharper bounds on four lattice constants
• The convergence of slide-type reductions
• Simple sufficient conditions for integer stabilizability of discrete-time systems with relative degree one
• A complete analysis of the BKZ lattice reduction algorithm
• On the smallest ratio problem of lattice bases

Describes a project that uses

Uses Software

• GitHub
• fpLLL

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)