Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:complexity |
polynomial time
|
| gptkbp:field |
gptkb:mathematics
computer science cryptography |
| https://www.w3.org/2000/01/rdf-schema#label |
LLL algorithm
|
| gptkbp:input |
basis of a lattice
|
| gptkbp:introducedIn |
1982
|
| gptkbp:inventedBy |
gptkb:Hendrik_Lenstra
gptkb:László_Lovász gptkb:Arjen_Lenstra |
| gptkbp:namedAfter |
gptkb:Lenstra–Lenstra–Lovász
|
| gptkbp:notableFor |
breaking knapsack cryptosystems
finding short vectors in lattices |
| gptkbp:output |
reduced basis of a lattice
|
| gptkbp:solvedBy |
lattice basis reduction
|
| gptkbp:usedFor |
gptkb:Diophantine_approximation
crypt integer programming factoring polynomials over rationals |
| gptkbp:bfsParent |
gptkb:Hendrik_Lenstra
gptkb:Lenstra–Lenstra–Lovász_lattice_basis_reduction_algorithm |
| gptkbp:bfsLayer |
6
|