Calculation of Minkowski-reduced lattice bases
DOI10.1007/BF02240194zbMath0557.10025OpenAlexW1514236938MaRDI QIDQ762199
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
algorithmrandom number generationlattice structurecomputational number theoryreduction of quadratic formsCholesky's methodgreater dimensionsMinkowski-reduced lattice bases
Lattices and convex bodies (number-theoretic aspects) (11H06) Random number generation in numerical analysis (65C10) Quadratic forms (reduction theory, extreme forms, etc.) (11H55) Algorithms in computer science (68W99)
Related Items (12)
Cites Work
- The sub-lattice structure of linear congruential random number generators
- Minkowskische Reduktionsbedingungen für positiv definite quadratische Formen in 5 Variablen
- 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
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- How to Calculate Shortest Vectors in a Lattice
- RANDOM NUMBERS FALL MAINLY IN THE PLANES
- The Lattice Structure of Multiplicative Congruential Pseudo-Random Vectors
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Calculation of Minkowski-reduced lattice bases