# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
A course in computational number theory. With CD-ROM. (English) Zbl 0945.11001
Emeryville, CA: Key College Publishing in cooperation with Springer. xii, 367 p. DM 129.00; öS 942.00; sFr. 117.00; £44.50; \$ 64.95 (2000).

This book is an introduction to elementary computational number theory. It is structured in nine chapters, and two appendices. Moreover, it is provided with a CD-ROM, which however requires Mathematica.

Chapter one is a recall of fundamentals, like the Euclidean algorithm, modular arithmetic or fast powers. Chapter two is devoted to solving linear congruences, and treats pseudoprimes as well. Chapter three concerns mainly Euler’s $\phi$ function and primitive roots for primes. Chapter four treats prime numbers, in particular prime testing and certification. Some applications, like the RSA cryptosystem, are described in Chapter five. Chapter six speaks about quadratic residues and provides a proof of the quadratic reciprocity law. Continued fractions are the heart of Chapter seven. The applications to prime testing of Lucas sequences is presented in Chapter eight. Chapter nine concerns Gaussian numbers and the problem of the decomposition of primes in sums of two squares.

Appendix A is an introduction to Mathematica, and finally appendix B provides a proof that Lucas certificates exist.

##### MSC:
 11-01 Textbooks (number theory) 11Yxx Computational number theory