Revised and updated by Todd Feil.
Hardcover ISBN:  9780883856475 
Product Code:  NML/22 
List Price:  $65.00 
MAA Member Price:  $48.75 
AMS Member Price:  $48.75 
eBook ISBN:  9780883859377 
Product Code:  NML/22.E 
List Price:  $50.00 
MAA Member Price:  $37.50 
AMS Member Price:  $37.50 
Hardcover ISBN:  9780883856475 
eBook: ISBN:  9780883859377 
Product Code:  NML/22.B 
List Price:  $115.00 $90.00 
MAA Member Price:  $86.25 $67.50 
AMS Member Price:  $86.25 $67.50 
Revised and updated by Todd Feil.
Hardcover ISBN:  9780883856475 
Product Code:  NML/22 
List Price:  $65.00 
MAA Member Price:  $48.75 
AMS Member Price:  $48.75 
eBook ISBN:  9780883859377 
Product Code:  NML/22.E 
List Price:  $50.00 
MAA Member Price:  $37.50 
AMS Member Price:  $37.50 
Hardcover ISBN:  9780883856475 
eBook ISBN:  9780883859377 
Product Code:  NML/22.B 
List Price:  $115.00 $90.00 
MAA Member Price:  $86.25 $67.50 
AMS Member Price:  $86.25 $67.50 

Book DetailsAnneli Lax New Mathematical LibraryVolume: 22; 2009; 212 pp
Originally published in the New Mathematical Library almost half a century ago, this charming book explains how to solve cryptograms based on elementary mathematical principles, starting with the Caesar cipher and building up to progressively more sophisticated substitution methods. Todd Feil has updated the book for the technological age by adding two new chapters covering RSA publickey cryptography, onetime pads, and pseudorandomnumber generators.
Exercises are given throughout the text that will help the reader understand the concepts and practice the techniques presented. The book assumes minimal mathematical prerequisites and therefore explains from scratch such concepts as summation notation, matrix multiplication, and modular arithmetic.

Table of Contents

Chapters

Chapter 1. Monoalphabetic Ciphers Using Additive Alphabets

Chapter 2. General Monoalphabetic Substitution

Chapter 3. Polyalphabetic Substitution

Chapter 4. Polygraphic Systems

Chapter 5. Transposition

Chapter 6. RSA Encryption

Chapter 7. Perfect SecurityOnetime Pads

Appendix A. Tables

Appendix B. ASCII Codes

Appendix C. Binary Numbers


Additional Material

Reviews

As a young mathematician, I learned how to make and break simple codes from Sinkov's beguiling introduction to cryptanalysis. In the intervening forty years there has been a revolution in cryptography, and it is fitting that for a modern edition of Sinkov's classic, Todd Feil has indicated the nature of this revolution by adding a lucid introduction to RSA publickey encryption and the number theory which underlies it. If you know a young code breaker who might become a young mathematician, buy her or him this book! Or buy it for yourself and try decoding those messages.
Phil Straffin, Professor Emeritus of Mathematics and Computer Science at Beloit College 
Sinkov's Elementary Cryptanalysis is an eminently readable classic that introduces the reader to both the techniques and the spirit of cryptanalysis  the art and science of reading secret messages. Todd Feil has done a fine job of modernizing the language of the original. His chapters on RSA encryption and onetime pads give added value to the original, especially the very nice treatment of RSA that assumes almost no prior knowledge of number theory.
Ezra Brown, Virginia Tech University


RequestsReview Copy – for publishers of book reviewsDesk Copy – for instructors who have adopted an AMS textbook for a courseExamination Copy – for faculty considering an AMS textbook for a courseAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Additional Material
 Reviews
 Requests
Originally published in the New Mathematical Library almost half a century ago, this charming book explains how to solve cryptograms based on elementary mathematical principles, starting with the Caesar cipher and building up to progressively more sophisticated substitution methods. Todd Feil has updated the book for the technological age by adding two new chapters covering RSA publickey cryptography, onetime pads, and pseudorandomnumber generators.
Exercises are given throughout the text that will help the reader understand the concepts and practice the techniques presented. The book assumes minimal mathematical prerequisites and therefore explains from scratch such concepts as summation notation, matrix multiplication, and modular arithmetic.

Chapters

Chapter 1. Monoalphabetic Ciphers Using Additive Alphabets

Chapter 2. General Monoalphabetic Substitution

Chapter 3. Polyalphabetic Substitution

Chapter 4. Polygraphic Systems

Chapter 5. Transposition

Chapter 6. RSA Encryption

Chapter 7. Perfect SecurityOnetime Pads

Appendix A. Tables

Appendix B. ASCII Codes

Appendix C. Binary Numbers

As a young mathematician, I learned how to make and break simple codes from Sinkov's beguiling introduction to cryptanalysis. In the intervening forty years there has been a revolution in cryptography, and it is fitting that for a modern edition of Sinkov's classic, Todd Feil has indicated the nature of this revolution by adding a lucid introduction to RSA publickey encryption and the number theory which underlies it. If you know a young code breaker who might become a young mathematician, buy her or him this book! Or buy it for yourself and try decoding those messages.
Phil Straffin, Professor Emeritus of Mathematics and Computer Science at Beloit College 
Sinkov's Elementary Cryptanalysis is an eminently readable classic that introduces the reader to both the techniques and the spirit of cryptanalysis  the art and science of reading secret messages. Todd Feil has done a fine job of modernizing the language of the original. His chapters on RSA encryption and onetime pads give added value to the original, especially the very nice treatment of RSA that assumes almost no prior knowledge of number theory.
Ezra Brown, Virginia Tech University