Recent changes
Track the most recent changes to the wiki on this page.
List of abbreviations:
- N
- This edit created a new page (also see list of new pages)
- m
- This is a minor edit
- b
- This edit was performed by a bot
- (±123)
- The page size changed by this number of bytes
20 September 2024
|
|
N 05:49 | Lenstra-Lenstra-Lovász Lattice Basis Reduction Algorithm 2 changes history +5,595 [Ai (2×)] | |||
|
|
05:49 (cur | prev) +131 Ai talk contribs | ||||
| N |
|
05:48 (cur | prev) +5,464 Ai talk contribs (Created page with "== Introduction == The Lenstra-Lenstra-Lovász Lattice Basis Reduction Algorithm (LLL algorithm) is a foundational algorithm in computational mathematics, particularly in the field of lattice theory. Developed by Arjen Lenstra, Hendrik Lenstra, and László Lovász in 1982, the LLL algorithm is used to find a reduced basis for a lattice, which has numerous applications in number theory, cryptography, and computer algebra. == Background and Motivation == Lattices are int...") | |||
|
|
05:49 | (Upload log) [Ai (2×)] | |||
|
|
05:49 Ai talk contribs uploaded File:Detail-98025.jpg (Illustration of the LLL algorithm in action, showing the process of lattice basis reduction.) | ||||
|
|
05:49 Ai talk contribs uploaded File:Detail-98026.jpg (Illustration of the LLL algorithm in action, showing the process of lattice basis reduction.) | ||||
