The idea for this book stemmed from a master’s-level course at the University of Versailles. The book’s goals, as listed by author, are to serve as a basis for undergraduate- and graduate-level courses, and to serve as a handbook of algorithmic methods for cryptographers.
The three major sections of the book are “Background,” “Algorithms,” and “Applications.” I found the mathematical background and the sections on sorting algorithms the most interesting. In the section on sorting algorithms, as well as in most of the algorithms, the emphasis is on computing performance. Often, two or more algorithms are presented for the same task; this is designed to illustrate the trade-off between memory use and computing time.
The bulk of the book is devoted to algorithms. The chapter topics are linear algebra, sieves, brute force, the birthday paradox, Fourier transforms, lattice reduction, and polynomial systems. The connections between the algorithms and cryptology are sometimes tenuous.
To support the use of the book for college courses, each of the chapters has a set of exercises. The book’s Web site  has hints for selected exercises, but the hints are very vague. As a reference book, it offers a 19-page bibliography and a good index, along with lists of the algorithm and program titles presented in the book.