La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász
RAIRO-Theor. Inf. Appl., 23 3 (1989) 345-376
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
On the reduction of a random basis
Ali Akhavi, Jean-François Marckert and Alain RouaultESAIM: Probability and Statistics 13 437 (2009)
https://doi.org/10.1051/ps:2008012
The optimal LLL algorithm is still polynomial in fixed dimension
Ali AkhaviTheoretical Computer Science 297 (1-3) 3 (2003)
https://doi.org/10.1016/S0304-3975(02)00616-3
Random lattices, threshold phenomena and efficient reduction algorithms
Ali AkhaviTheoretical Computer Science 287 (2) 359 (2002)
https://doi.org/10.1016/S0304-3975(01)00251-1
Cryptography and Lattices
Phong Q. Nguyen and Jacques SternLecture Notes in Computer Science, Cryptography and Lattices 2146 146 (2001)
https://doi.org/10.1007/3-540-44670-2_12
LATIN 2000: Theoretical Informatics
Ali AkhaviLecture Notes in Computer Science, LATIN 2000: Theoretical Informatics 1776 355 (2000)
https://doi.org/10.1007/10719839_35
Algorithmic Number Theory
Phong Q. Nguyen and Jacques SternLecture Notes in Computer Science, Algorithmic Number Theory 1838 85 (2000)
https://doi.org/10.1007/10722028_4
Algorithms - ESA’ 99
Ali AkhaviLecture Notes in Computer Science, Algorithms - ESA’ 99 1643 476 (1999)
https://doi.org/10.1007/3-540-48481-7_41
Finding a shortest vector in a two-dimensional lattice modulo m
Günter RoteTheoretical Computer Science 172 (1-2) 303 (1997)
https://doi.org/10.1016/S0304-3975(96)00185-5
An upper bound on the average number of iterations of the LLL algorithm
Hervé Daudé and Brigitte ValléeTheoretical Computer Science 123 (1) 95 (1994)
https://doi.org/10.1016/0304-3975(94)90071-X
830 (1990)
https://doi.org/10.1109/FSCS.1990.89606