Lenstra–Lenstra–Lovász lattice basis reduction algorithm

E1945071 UNEXPLORED

The Lenstra–Lenstra–Lovász lattice basis reduction algorithm is a foundational polynomial-time algorithm in computational number theory and cryptography that efficiently finds nearly orthogonal short vectors in integer lattices.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (2)

Label	Occurrences
LLL lattice basis reduction algorithm	1
Lenstra–Lenstra–Lovász lattice basis reduction algorithm canonical	1

Referenced by (2)

Full triples — surface form annotated when it differs from this entity's canonical label.

LLL algorithm → fullName → Lenstra–Lenstra–Lovász lattice basis reduction algorithm ⓘ

algorithmic number theory → notableAlgorithm → LLL lattice basis reduction algorithm ⓘ

linked to: Lenstra–Lenstra–Lovász lattice basis reduction algorithm