Calculation of Minkowski-reduced lattice bases

DOI10.1007/BF02240194zbMATH Open0557.10025OpenAlexW1514236938MaRDI QIDQ762199FDOQ762199

Authors: Lothar Afflerbach, Holger Grothe 

Publication date: 1985

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02240194

Recommendations

• scientific article; zbMATH DE number 3908519
• Reduction of lattice bases for arbitrary norms
• Algorithms to construct Minkowski reduced and Hermite reduced lattice bases
• scientific article; zbMATH DE number 799775
• scientific article; zbMATH DE number 4073089
• Computing a lattice basis revisited
• Practical, Predictable Lattice Basis Reduction
• Lattice basis reduction for indefinite forms and an application
• scientific article; zbMATH DE number 1186973
• Low-dimensional lattice basis reduction revisited

zbMATH Keywords

algorithmrandom number generationlattice structurecomputational number theoryreduction of quadratic formsCholesky's methodgreater dimensionsMinkowski-reduced lattice bases

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Lattices and convex bodies (number-theoretic aspects) (11H06) Quadratic forms (reduction theory, extreme forms, etc.) (11H55) Algorithms in computer science (68W99)

Cites Work

• RANDOM NUMBERS FALL MAINLY IN THE PLANES
• On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
• How to Calculate Shortest Vectors in a Lattice
• The theory of Hermite-Minkowski reduction of positive definite quadratic forms
• The Hermite-Minkowski domain of reduction of positive definite quadratic forms in six variables
• Regularities in congruential random number generators
• The sub-lattice structure of linear congruential random number generators
• Minkowskische Reduktionsbedingungen für positiv definite quadratische Formen in 5 Variablen
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Lattice Structure of Multiplicative Congruential Pseudo-Random Vectors

Cited In (17)

• Computing a lattice basis from a system of generating vectors
• Efficient algorithms for discrete lattice calculations
• Criteria for the assessment of random number generators
• Parallel Cholesky-based reduction for the weighted integer least squares problem
• Geodesic continued fractions and LLL
• Upper bounds in spectral test for multiple recursive random number generators with missing terms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Several extensively tested multiple recursive random number generators
• A statistical analysis of the screening measure of multiple recursive random number generators of orders one and two
• Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors
• The sub-lattice structure of linear congruential random number generators
• Upper bounds for the Beyer ratios of linear congruential generators
• Uniform random number generation
• The lattice structure of pseudo-random vectors generated by matrix generators
• On the distribution of integration error by randomly-shifted lattice rules
• On the structure of quadratic congruential sequences

This page was built for publication: Calculation of Minkowski-reduced lattice bases

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