Abstract
This book deals with algorithmic problems concerning binary quadratic forms f(X, Y) = aX2 + bXY + cY2 with integer coe.cients a, b, c, the mathematical theories that permit the solution of these problems, and applications to cryptography. A considerable part of the theory is developed for forms with real coe.cients and it is shown that forms with integer coe.cients appear in a natural way.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer
About this chapter
Cite this chapter
Buchmann, J., Vollmer, U. (2007). Introduction. In: Binary Quadratic Forms. Algorithms and Computation in Mathematics, vol 20. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46368-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-46368-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46367-2
Online ISBN: 978-3-540-46368-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)