Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Cryptanalysis : a study of ciphers and their solutions
Gaines H., Dover Publications, Incorporated, Mineola, NY, 2000. 237 pp. Type: Book (9780486200972)
Date Reviewed: Dec 20 2004

This book, which was first published in 1939, does not contain any recent ciphers. Aside from historic interest, readers will enjoy breaking quite complicated ciphers, on a level that requires no previous knowledge of cryptanalysis. In that sense, this is a follow-up book to Singh’s book [1]; students may enjoy Gaines’ book as a “play book.” This book always starts by explaining a cipher, and how it can be broken. An example illustrates each attack, and additional exercises, including solutions, are provided.

In the book’s 235 pages, both well-known ciphers, such as simple substitutions and Vignere, and not-so-well-known methods, such as those from Gronsfeld, Porta, or Kosiki, are covered. While the content is not taught in typical courses on computer security, the book provides enjoyable reading that requires a fair amount of thinking and problem solving skills (even though most of us will never need to manually break these ciphers).

Reviewer:  Edgar R. Weippl Review #: CR130547 (0508-0861)
1) Singh, S. The code book. Anchor, New York, NY, 2000.
Bookmark and Share
  Featured Reviewer  
 
Code Breaking (E.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Code Breaking": Date
Correlation properties of an improved summation generator with 2-bit memory
Chan C., Cheng L. Signal Processing 82(6): 907-909, 2002. Type: Article
Feb 14 2003
Strength of two data encryption standard implementations under timing attacks
Hevia A., Kiwi M. ACM Transactions on Information and System Security 2(4): 416-437, 1999. Type: Article
Jul 1 2000
An information-theoretic model for steganography
Cachin C. Information and Computation 192(1): 41-56, 2004. Type: Article
Oct 5 2004
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy