arXiv Open Access 2018

Computing an LLL-reduced basis of the orthogonal lattice

Jingwei Chen Damien Stehlé Gilles Villard

Lihat Sumber

Abstrak

As a typical application, the Lenstra-Lenstra-Lovasz lattice basis reduction algorithm (LLL) is used to compute a reduced basis of the orthogonal lattice for a given integer matrix, via reducing a special kind of lattice bases. With such bases in input, we propose a new technique for bounding from above the number of iterations required by the LLL algorithm. The main technical ingredient is a variant of the classical LLL potential, which could prove useful to understand the behavior of LLL for other families of input bases.

Topik & Kata Kunci

cs.SC

Penulis (3)

Jingwei Chen

Damien Stehlé

Gilles Villard

Format Sitasi

APA MLA BibTeX

Chen, J., Stehlé, D., Villard, G. (2018). Computing an LLL-reduced basis of the orthogonal lattice. https://arxiv.org/abs/1805.03418

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2018
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓