- Hardcover: 264 pages
- Publisher: Wiley; 1 edition (March 17, 2008)
- Language: English
- ISBN-10: 047013593X
- ISBN-13: 978-0470135938
- Product Dimensions: 7.6 x 0.8 x 9.5 inches
- Shipping Weight: 1.2 pounds (View shipping rates and policies)
- Average Customer Review: 8 customer reviews
- Amazon Best Sellers Rank: #787,089 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Modern Cryptanalysis: Techniques for Advanced Code Breaking 1st Edition
Use the Amazon App to scan ISBNs and compare prices.
All Books, All the Time
Read author interviews, book reviews, editors picks, and more at the Amazon Book Review. Read it now
Frequently bought together
Customers who bought this item also bought
From the Back Cover
Fighting new threats with an old weapon
As an instructor at the University of Tulsa, Christopher Swenson could find no relevant text for teaching modern cryptanalysis. So he wrote his own. You are holding the first book that brings the study of cryptanalysis into the 21st century.
Swenson provides a foundation in traditional cryptanalysis, examines ciphers based on number theory, explores block ciphers, and teaches the basis of all modern cryptanalysis linear and differential cryptanalysis. Thistime-honored weapon of warfare has become a key piece of artillery in the battle for information security.
- Refresh your knowledge of probability theory, number theory, and algebra as required for advanced cryptanalysis
- Explore number theoretic and algebraic cipher techniques
- Learn about concepts used in building modern block ciphers, including Feistel structures, substitution-permutation networks, and shift registers
- See how various brute force techniques, complexity theory, and rainbow tables are applied
- Become acquainted with linear and multilinear cryptanalysis and their derivatives
- Examine differential cryptanalysis and its descendents
About the Author
CHRISTOPHER SWENSON is a PhD candidate and a Department of Defense employee working in vulnerability analysis. He has received a coveted national scholarship award from the Information Assurance Scholarship Program and belongs to the International Association for Cryptologic Research (IACR) as well as the American Mathematical Society (AMS).
Top customer reviews
I bought this book almost entirely because of the title and the fact that when I flipped through it, I saw some math. I should have noticed (but didn't) that it was a Wiley book. In my opinion, these are almost always short on detail and full of padding and repetition. This book reminded me to avoid Wiley books no matter what the title is. They seem to always let me down.
It gets a couple of stars because it does contain a good bibliography. I have learned more studying the cited books and papers than the book itself. I believe (or hope, I can't tell) the author knows this material, but was led astray by his editor.
* Background and history of cryptography
* Overview of the important cryptographic solutions currently being used (S-boxes, Feistel structures, DES, etc.)
* Details on mathematics of how encryption algorithms work, to the point of understanding their exploitable vulnerabilities, not just their well-publicized strengths
Each chapter is also concluded with a summary and exercises, to help you better understand and learn by doing. The following are three chapters I thought that really stood out.
This chapter provides an excellent introduction to the beginnings of cryptography (ROT13, even Klingon!) This chapter dovetails nicely into coincidence and how to start performing cryptanalysis, studying algorithmic flaws. As an aside, the discussion on the Vigenere Tableau goes well with the more detailed chapter on the same topic in The Code Book by Simon Singh.
Number Theoretical Ciphers
What I liked about this chapter is that it contained sections like Probability, which begins with what every Stats course begins with: the coin flip. But subtly the chapter gets more complicated, evolving to permutations, dependence, then breaks with the section Fun With Poker. After this is the Birthday Paradox, an important demonstration of probability, then moves on to cryptographic hashes. This is an example of how the chapters work: they start out with the basics, then lead you into more and more detail.
The section Number Theory Refresher Course in this chapter was the reason I got the book, and I wasn't disappointed. It gets the reader ready for the involved math that is to follow in the rest of the book.
This chapters covers all the different forms of modern block ciphers. It begins with an overview of binary arithmetic, then moves on to the S-box, P-box, and shift registers. FEAL, DES, and Fiestel Structures are covered, including some demonstrative Python code. All of the other important ciphers are also included: Blowfish, AES, MD5, each with it's own quick history section. Random Number Generators earns its own section, importantly, because it's the generation of predictable numbers that often is the flaw in cryptographic implementations.
I got what I wanted out of the book: a good background on fundamental concepts of cryptography, a good introduction on how cryptanalysis can be performed on what seems to be unbreakable ciphers, and enough math to keep me busy for a long time. There's also some Python code snippets to help explain how how some pieces of encryption solutions work. Also at the end of each chapter is a list of references, providing ample reading material to continue your learning.
If you are interested in cryptography beyond just to how to implement prepackaged solutions, this book is a great primer. This would also serve as a great textbook for any cryptography class.