Abstract
We prove that to find a nontrivial integer linear relation between vectors of a lattice L ⊂ℝn, whose euclidean length is at most M, one needs O (n 5+ε(ln Mn/λ)1+ε) binary operations for any ε > O, where λ is the first successive minimum of L.
Preview
Unable to display preview. Download preview PDF.
References
Gordon, D.M., Discrete logarithms in GF(p) using the number field sieve, SIAM J. Disc. Math. 6 (1993) 124–138
Lenstra, A.K., Lenstra, Jr., H.W., Lovasz, L. Factoring polynomials with rational coefficients Math. Ann. 261 (1982) 515–534
Dobrowolski, E. On the maximal modulus of conjugates o an algebraic integer Bull. Acad. Polon. Sci. Ser. Sci. Math. Astronom. Phys. 26 (1978) 291–292
Schmidt, W.M. Diophantine approximation, Springer-Verlag NY (1980)
Khinchin, A.Ja., Continued fractions, “Nauka,” Moscow, 1978 (in Russian)
Vorob'ev, N.N., Jr., Fibonacci numbers, “Nauka,” Moscow, 1984 (in Russian)
Aho, A., Hopcroft, J., Ullman, J. The design and analysis of computer algorithms, Addison-Wesley Reading MA (1974)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Semaev, I.A. (1998). Evaluation of linear relations between vectors of a lattice in euclidean space. In: Buhler, J.P. (eds) Algorithmic Number Theory. ANTS 1998. Lecture Notes in Computer Science, vol 1423. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054871
Download citation
DOI: https://doi.org/10.1007/BFb0054871
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64657-0
Online ISBN: 978-3-540-69113-6
eBook Packages: Springer Book Archive