Log In Sign Up

Lattice reduction by cubification

by   Cyril Cayron, et al.

Lattice reduction is a NP-hard problem well known in computer science and cryptography. The Lenstra-Lenstra-Lovasz (LLL) algorithm based on the calculation of orthogonal Gram-Schmidt (GS) bases is efficient and gives a good solution in polynomial time. Here, we present a new approach called cubification that does not require the calculation of the GS bases. It relies on complementary directional and hyperplanar reductions. The deviation from cubicity at each step of the reduction process is evaluated by a parameter called lattice rhombicity, which is simply the sum of the absolute values of the metric tensor. Cubification seems to equal LLL; it even outperforms it in the reduction of columnar matrices. We wrote a Python program that is ten times faster than a reference Python LLL code. This work may open new perspectives for lattice reduction and may have implications and applications beyond crystallography.


page 1

page 2

page 3

page 4


Faster Lattice Enumeration

A lattice reduction is an algorithm that transforms the given basis of t...

Computing an LLL-reduced basis of the orthogonal lattice

As a typical application, the Lenstra-Lenstra-Lovasz lattice basis reduc...

Effects of Some Lattice Reductions on the Success Probability of the Zero-Forcing Decoder

Zero-forcing (ZF) decoder is a commonly used approximation solution of t...

A lattice formulation of the F4 completion procedure

We write a procedure for constructing noncommutative Groebner bases. Red...

Generating cryptographically-strong random lattice bases and recognizing rotations of ℤ^n

Lattice-based cryptography relies on generating random bases which are d...

Certified lattice reduction

Quadratic form reduction and lattice reduction are fundamental tools in ...

Performance Limits of Lattice Reduction over Imaginary Quadratic Fields with Applications to Compute-and-Forward

In this work, we first examine both Hermite's constant and Minkowski's t...