Lenstra–Lenstra–Lovász lattice basis reduction
GPTKB entity
Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:abbreviation |
gptkb:LLL_algorithm
|
| gptkbp:complexity |
polynomial time
|
| gptkbp:field |
gptkb:mathematics
computer science cryptography |
| gptkbp:introducedIn |
1982
|
| gptkbp:inventedBy |
gptkb:Hendrik_Lenstra
gptkb:László_Lovász gptkb:Arjen_Lenstra |
| gptkbp:namedAfter |
gptkb:Hendrik_Lenstra
gptkb:László_Lovász gptkb:Arjen_Lenstra |
| gptkbp:notableFor |
breaking knapsack cryptosystems
cryptanalysis of public-key cryptosystems finding integer relations |
| gptkbp:output |
reduced lattice basis
|
| gptkbp:relatedTo |
lattice theory
shortest vector problem basis reduction |
| gptkbp:solvedBy |
lattice basis reduction
|
| gptkbp:usedIn |
gptkb:crypt
integer programming factoring polynomials over rationals |
| gptkbp:bfsParent |
gptkb:Hendrik_Lenstra
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Lenstra–Lenstra–Lovász lattice basis reduction
|