Cryptography, as done in this century, is heavily mathematical. But it also has roots in what is computationally feasible.
This unique and accessible textbook balances the theorems of mathematics against the feasibility of computation. Cryptography is something one actually "does", not a mathematical game about which one proves theorems. There is deep math; there are some theorems that must be proven; and there is a need to recognize the brilliant work done by those who focus on theory. But at the level of an undergraduate course, the emphasis should be first on knowing and understanding the algorithms and how to implement them, and also to be aware that the algorithms must be implemented carefully to avoid the "easy" ways to break the cryptography. Hence, this text covers the algorithmic foundations and is complemented by core mathematics and arithmetic.
Topics and features:
Provides an exhaustive set of useful examples, to optimally convey thecryptographic computations
Focuses on doing cryptography, rather than on proving theorems
Includes detailed source code and a test suite
Describes NTRU as a lattice-based cryptographic algorithm
Addresses, among other topics, factoring attacks (including their history), elliptic curve cryptography, quantum cryptography, and homomorphic encryption
This clearly written introductory textbook emphasizes how implementation issues affect algorithm decisions and will reinforce learning for computer science (or mathematics) students studying cryptography at the undergraduate level. In addition, it will be ideal for professional short courses or self-study.
Duncan Buell, professor emeritus in the Dept. of Computer Science and Engineering at University of South Carolina, also has 15 years of experience at a research lab doing high-performance computing research in support of the U.S. National Security Agency.
