Elementary Cryptanalysis: A Mathematical Approach (Mathematical Association of America Textbooks, Series Number 22)

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 fundamental mathematical concepts and methods. In this book, Sinkov gives us the mathematical side of elementary cryptography, the single and multiple replacement functions, transpositions, and the like used to encode messages, and how to crack such ciphers. He also shows how the code breaker uses statistical and other regularities of language to deduce the coding and decoding functions. Also included are BASIC programs developed by Paul L. Irwin for use in his course based on this book.

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.

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 fundamental mathematical concepts and methods. In the first two chapters treat monoalphabetic substitutions of increasing complexity, Chapter 3 discusses polyalphabetic substitutions, Chapter 4 acquaints the reader with polygraphic systems, specially digraphic ciphers based on linear transformations, and Chapter 5 treats transpositions. The mathematical topics relevant in these discussions include modular arithmetic, a bit of number theory, some linear algebra of two dimensions with matrices, some combinatorics, and a bit of statistics. -- from back cover One of the earliest cryptographic systems known was used by Julius Caesar and is referred to by his name-the Caesar Cipher.