Elementary Cryptanalysis: A Mathematical Approach

Most people, acquainted with cryptology either through sensational cloak and dagger stories or through newspaper cryptograms, are not aware that many aspects of this art may be treated systematically, by means of some elementary mathematical concepts and methods. In this introduction, Professor Sinkov explains some of the fundamental techniques at the basis of cryptanalytic endeavor from which much more sophisticated techniques have evolved, especially since the advent of computers. The mathematical topics relevant in these discussions include modular arithmetic, a little number theory, some linear algebra of two dimensions with matrices, some combinatorics, and a little statistics. Also included are programs in BASIC developed by Paul Irwin for use in his course based on this book.

Abraham Sinkov obtained his PhD at George Washington University in 1933. He was a Professor of Mathematics at Arizona State University.