Strongly Reduced Lattice Bases

04/24/2023
by   Christian Porter, et al.
0

In this paper, we show that for each lattice basis, there exists an equivalent basis which we describe as “strongly reduced”. We show that bases reduced in this manner exhibit rather “short” basis vectors, that is, the length of the ith basis vector of a strongly reduced basis is upper bounded by a polynomial factor in i multiplied by the ith successive minima of the lattice. The polynomial factor seems to be smaller than other known factors in literature, such as HKZ and Minkowski reduced bases. Finally, we show that such bases also exhibit relatively small orthogonality defects.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/01/2020

Obtuse Lattice Bases

A lattice reduction is an algorithm that transforms the given basis of t...
research
11/20/2018

On compact representations of Voronoi cells of lattices

In a seminal work, Micciancio & Voulgaris (2010) described a determinist...
research
11/12/2021

Reduction Theory of Algebraic Modules and their Successive Minima

Lattices defined as modules over algebraic rings or orders have garnered...
research
04/07/2018

Why 1.02? The root Hermite factor of LLL and stochastic sandpile models

In lattice-based cryptography, a disturbing and puzzling fact is that th...
research
05/08/2017

Dimension-Dependent Upper Bounds for Grobner Bases

We improve certain degree bounds for Grobner bases of polynomial ideals ...
research
10/21/2019

Finding duality and Riesz bases of exponentials on multi-tiles

It is known that if Ω⊂R^d is bounded, measurable set that forms a k-tili...
research
01/22/2019

Dualization in lattices given by implicational bases

It was recently proved that the dualization in lattices given by implica...

Please sign up or login with your details

Forgot password? Click here to reset