Skip to search formSkip to main contentSkip to account menu

Lenstra–Lenstra–Lovász lattice basis reduction algorithm

Known as: LLL basis reduction method, Lenstra–Lenstra–Lovasz lattice basis reduction algorithm, Lenstra-Lenstra-Lovasz algorithm 
The Lenstra–Lenstra–Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The Lenstra-Lenstra-Lovász (LLL) algorithm has been adopted as a lattice reduction (LR) technique for multiple-input multiple… 
2011
2011
For the fully homomorphic encryption schemes in [3, 6], this paper presents attacks to solve an equivalent secret key and… 
2010
2010
Continuous and Discrete Methods in Computer Science.- Colorful Strips.- The Mono- and Bichromatic Empty Rectangle and Square… 
2008
2008
Let p be a prime number and n a positive integer, and let q D p. Let Fq be the field of q elements and denote by F q the… 
2003
2003
(ABSTRACT) High-impedance faults (HIFs) on distribution feeders are abnormal electrical conditions that cannot be detected by… 
2003
2003
The admittance of the quartz crystal microbalance (QCM) was used to study properties of a liquidlike layer (LLL) at the gold… 
1996
1996
As students of language we were often asked: ‘How different are Chinese dialects?’ In the past, our standard answer to questions… 
1996
1996
The author uses irrationality and linear independence measures for certain algebraic numbers to derive explicit upper bounds for… 
1992
1992
The field of moral development has broadened recently from its traditional Kohlbergian emphasis on justice to include other… 
1991
1991
At the last Eurocrypt meeting, a cryptosystem based on modular knapsacks was proposed (see [11]). We show that this system is not…