La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász-Reference-Cited by-同舟云学术

La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász

Published:1989 Issue:3 Volume:23 Page:345-376
ISSN:0988-3754
Container-title:RAIRO - Theoretical Informatics and Applications
language:
Short-container-title:RAIRO-Theor. Inf. Appl.

Author:

Vallée Brigitte

Publisher

EDP Sciences

Subject

Computer Science Applications,General Mathematics,Software

Link

http://www.rairo-ita.org/10.1051/ita/1989230303451/pdf

Reference27 articles.

1. 1. BABAI L., On Lovász's Lattice Reduction and the Nearest Lattice Point Problem, Combinatorica, vol. 5, 1985.0593.68030

2. 2. FRIEZE A., HASTAD J., KANNAN R., LAGARIAS J. C. et SHAMIR A., Reconstructing Truncated Integer Variables Satisfying Linear Congruences,, in S.I.A.M. Journal on Computing (to appear).9353400654.10006

3. 3. DUPRÉ A., Journal de Mathématiques, vol.11, 1846, p. 41-64.234093

4. 4. GAUSS C. F., Recherches Arithmétiques, Paris, 1807, réimprimé par Blanchard, Paris, 1953.0051.0300342.0236.19

5. 4. HASTAD J., JUST B., LAGARIAS J. C. et SCHNORR C. P., Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers, Proceedings of S.T.A.C.S., Lecture Notes in Computer Science, 1986 0606.68033

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the reduction of a random basis;ESAIM: Probability and Statistics;2009-07

2. The optimal LLL algorithm is still polynomial in fixed dimension;Theoretical Computer Science;2003-03

3. Random lattices, threshold phenomena and efficient reduction algorithms;Theoretical Computer Science;2002-09

4. The Two Faces of Lattices in Cryptology;Lecture Notes in Computer Science;2001

5. Worst-Case Complexity of the Optimal LLL Algorithm;Lecture Notes in Computer Science;2000