Binary quadratic forms. An algorithmic approach (Q873951)

Because of its historic algorithms, Quadratic Field Theory is the best platform for the development of a computer viewpoint. Such an idea is not dominant in earlier texts on quadratic forms [e.g., \textit{D. A. Buell}, Binary Quadratic Forms. New York: Springer-Verlag (1989; Zbl 0698.10013), \textit{R. A. Mollin}, Quadratics. Boca Raton, FL: CRC Press (1996; Zbl 0858.11001), \textit{D. Cox}, Primes of the form \(x^2+ny^2\). New York: Wiley (1989; Zbl 0701.11001), etc.]. As a result this book reads like a continuous program with major topics occurring as subroutines. The theory appears as ``program comments,'' accompanied by numerical examples. The obligatory ``Baby Step -- Giant Step,'' combines \textit{D. Shanks} with \textit{D. C. Terr} [Math. Comput. 69, 767--773 (2000; Zbl 0940.68038)]. The overall complexity of the class structure is as yet subexponential (fourth root of the discriminant) using the ERH. Then comes the intractibility required for cryptography. An appendix explaining linear algebra (bases and matrices) helps make this work ideal as a self-contained well-motivated textbook for computer-oriented students at any level and as a reference book.