{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T23:40:01Z","timestamp":1749944401657,"version":"3.41.0"},"reference-count":27,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1989]]},"DOI":"10.1051\/ita\/1989230303451","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T15:07:34Z","timestamp":1486048054000},"page":"345-376","source":"Crossref","is-referenced-by-count":10,"title":["La r\u00e9duction des r\u00e9seaux. Autour de l'algorithme de Lenstra, Lenstra, Lov\u00e1sz"],"prefix":"10.1051","volume":"23","author":[{"given":"Brigitte","family":"Vall\u00e9e","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. BABAI L., On Lov\u00e1sz's Lattice Reduction and the Nearest Lattice Point Problem, Combinatorica, vol. 5, 1985.0593.68030"},{"key":"R2","unstructured":"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"},{"key":"R3","unstructured":"3. DUPR\u00c9 A., Journal de Math\u00e9matiques, vol.11, 1846, p. 41-64.234093"},{"key":"R4","unstructured":"4. GAUSS C. F., Recherches Arithm\u00e9tiques, Paris, 1807, r\u00e9imprim\u00e9 par Blanchard, Paris, 1953.0051.0300342.0236.19"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1007\/3-540-16078-7_69"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. HELFRICH B., Algorithms to Construct Minkowski and Hermite Reduced Bases, Theoretical Computer Science, vol. 41, 1985, p. 125-139.8476730601.68034","DOI":"10.1016\/0304-3975(85)90067-2"},{"key":"R7","unstructured":"7. CASSELS J. W. S., Rational Quadratic Forms, Academic Press, 1978.5228350395.10029"},{"key":"R8","unstructured":"8. KALTOFEN E. et ROLLETSCHEK H., Arithmetic in Quadratic Fields with Unique Factorization, Comptes rendus de EUROCAL'85, Lectures notes in Computer Science, 204, Springer-Verlag.8265690596.12001"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. KANNAN R., Improved Algorithms for Integer programming and Related Lattice Problem, J.A.C.M., 1983, p. 193-206.","DOI":"10.1145\/800061.808749"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. KANNAN R., LENSTRA H. W. et LOV\u00c1SZ L., Polynomial Factorization and Bits of Algebraic and Some Transcendental Numbers, Mathematics of Computation, vol. 50, n\u00b0 181, 1988, p. 235-250.9178310654.12001","DOI":"10.2307\/2007927"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. LAGARIAS J. C., Computational Complexity of Simultaneous Diophantine Approximation Problem, 23rd I.E.E.E. Symp. F.O.C.S., 1982.780377","DOI":"10.1109\/SFCS.1982.43"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. LAGARIAS J. C. et ODLYZKO A., Solving Low-Density Subset Sum Problems, 24th I.E.E.E. Symp. F.O.C.S., 1983.0632.94007","DOI":"10.1109\/SFCS.1983.70"},{"key":"R13","unstructured":"13. LAGARIAS J. C., LENSTRA H. W. et SCHNORR C. P., Korkine-Zolotarev Bases and Successive Minima of a Lattice and its Reciprocal Lattice, Technical Report, M.S.R.I. 07718-86, Mathematical Sciences Research Institute, Berkeley.0723.11029"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"14. LANDAU S. et MILLER G. L., Solvability by Radicals is in Polynomial Time, 15th Annual A.C.M. Symposium on Theory of Computing, 1983.0586.12002","DOI":"10.1145\/800061.808743"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"15. LENSTRA A. K., LENSTRA H. W. et LOVASZ L., Factoring Polynomial with Rational Coefficients, Math. Annalen, vol. 261, 1982, p. 513-534.1829036826640488.12001","DOI":"10.1007\/BF01457454"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"16. LENSTRA H. W., Integer Programming with a Fixed Number of Variables, Mathematics of Operations Research, vol 8, n\u00b0 4, nov. 1983.7274100524.90067","DOI":"10.1287\/moor.8.4.538"},{"key":"R17","unstructured":"17. LOVASZ L., An Algorithmic Theory of Numbers, Graphs and Convexity, Technical Report, Universitat Bonn.0606.68039"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"18. SHAMIR A., A Polynomial Time Algorithmfor Breahing theMerkle-Hellman Cryptosystem, 23rd I.E.E.E. Symp. F.O.C.S., 1982.","DOI":"10.1109\/SFCS.1982.5"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"19. SCHONHAGE A., Factorization of Univariate Integer Polynomial by Diophantine Approximation and by an Improved Basis Reduction Algorithm, Proceedings of the 11th I.C.A.L.P., Antwerpen, 1984, Lecture Notes in Computer Science, Vol. 172, Springer, 1984.7842700569.68030","DOI":"10.1007\/3-540-13345-3_40"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"20. SCHNORR C. P., A More efficient Algorithm for Lattice Basis Reduction, Proceedings of the 13th I.C.A.L.P., Rennes, 1986, Lecture Notes in Computer Science, vol. 226, Springer, 1986, dans Journal of Algorithms, 1987 (\u00e0 para\u00eetre).8646980595.68038","DOI":"10.1007\/3-540-16761-7_85"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"21. SCHNORR C. P., A Hierarchy of Polynomial Tume Lattice Basis Reduction Algorithms, Theoretical Computer Science, vol. 53, 1987, p. 201-224.9180900642.10030","DOI":"10.1016\/0304-3975(87)90064-8"},{"key":"R22","unstructured":"22. STERN J., Lectures Notes, University of Singapore, 1986."},{"key":"R23","doi-asserted-by":"crossref","unstructured":"23. STERN J., Secret Linear Congruential Generatorsare not Cryptographically Secure, 28th I.E.E.E. Symp. F. O. C. S., 1987.","DOI":"10.1109\/SFCS.1987.51"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"24. VALL\u00c9E B., Provably fast integor factoring algorithm with quasi-uniform small quadratic residues, ACM. STOC 89, p. 98-106.","DOI":"10.1145\/73007.73016"},{"key":"R25","unstructured":"25. VALL\u00c9E B., Une approche g\u00e9om\u00e9trique de la r\u00e9duction des r\u00e9seaux enpetite dimension, Th\u00e8se de doctorat de l'Universit\u00e9 de Caen (1986), r\u00e9sum\u00e9 paru dans le S\u00e9minaire de Th\u00e9orie des Nombres de Bordeaux (1986), et dans Proceedings of EUROCAL'87, Lecture notes in Computer Science, Springer (\u00e0 para\u00eetre).0602.10022"},{"key":"R26","unstructured":"26. VALL\u00c9E B., GIRAULT M. et TOFFIN Ph., HOW to Guess l-th Roots Modulo n by Reducing Lattice Bases, Pr\u00e9publications de l'Universit\u00e9 de Caen, 1988, First International Joint Conference of I.S.S.A.C.-88 and A.A.E.C.C-6, juillet 1988(soumis).10085180692.10005"},{"key":"R27","unstructured":"27. VAN EMDE BOAS P., Another NP-Complete Partition Problem and the Complexity of Computing Short Vectors in a Lattice, Rep. MI, U.V.A. 81-04, Amsterdam, 1981"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1989230303451\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T23:17:34Z","timestamp":1749943054000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1989230303451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"references-count":27,"journal-issue":{"issue":"3"},"alternative-id":["ita1989230303451"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1989230303451","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"type":"print","value":"0988-3754"},{"type":"electronic","value":"1290-385X"}],"subject":[],"published":{"date-parts":[[1989]]}}}