Abstract
The single most useful algorithm of computational number theory is the LLL lattice basis reduction algorithm of Lenstra, Lenstra, and Lovász [1982]. It finds a relatively short vector in an integer lattice. In this chapter we give some examples of how LLL can be used to approach some of the central problems of the book. Appendix B deals, in detail, with the LLL algorithm and the closely related PSLQ algorithm for finding integer relations. In many of our applications LLL can be treated as a “black box”—why it works doesn’t matter. One inputs a lattice and receives as output a candidate short vector that can be verified to have the requisite properties for the particular problem under consideration.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsSelected References
H. Cohen, A Course in Computational Algebraic Number Theory, Springer-Verlag, Berlin, 1993.
A.K. Lenstra, H.W. Lenstra, and L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 515–534.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Borwein, P. (2002). LLL and PSLQ. In: Computational Excursions in Analysis and Number Theory. CMS Books in Mathematics / Ouvrages de mathématiques de la SMC. Springer, New York, NY. https://doi.org/10.1007/978-0-387-21652-2_2
Download citation
DOI: https://doi.org/10.1007/978-0-387-21652-2_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-3000-2
Online ISBN: 978-0-387-21652-2
eBook Packages: Springer Book Archive