Secret history : the story of cryptology
Record details
- ISBN: 9781466561861 (hardback)
- ISBN: 1466561866 (hardback)
-
Physical Description:
print
xxv, 594 pages : illustrations ; 24 cm. - Publisher: Boca Raton : CRC Press, Taylor & Francis Group, [2013]
Content descriptions
Bibliography, etc. Note: | Includes bibliographical references and index. |
Formatted Contents Note: | Ancient Roots -- Monalphabetic Substitution Ciphers, or MASCs: Disguises for Messages -- Simple progression to an unbreakable cipher -- Transposition Ciphers -- Shakespeare, Jefferson, and JFK -- World War I and Herbert O. Yardley -- Matrix Encryption -- World War II: The Enigma of Germany -- Cryptologic War against Japan -- Claude Shannon -- National Security Agency -- Data Encryption Standard -- Birth of Public Key Cryptography -- Attacking RSA -- Primality Testing and Complexity Theory -- Authenticity -- Pretty Good Privacy -- Stream Ciphers -- Suite B All-Stars -- Possible Futures. |
Search for related items by subject
Subject: | Data encryption (Computer science) Computer security Cryptography History Ciphers |
Search for related items by series
Available copies
- 1 of 1 copy available at Kirtland Community College.
Holds
- 0 current holds with 1 total copy.
Show Only Available Copies
Location | Call Number / Copy Notes | Barcode | Shelving Location | Status | Due Date |
---|---|---|---|---|---|
Kirtland Community College Library | QA 76.9 .A25 B384 2013 | 30775305471808 | General Collection | Available | - |
Secret History : The Story of Cryptology
Click an element below to view details:
Table of Contents
Secret History : The Story of Cryptology
Section | Section Description | Page Number |
---|---|---|
Note to the Reader | p. xv | |
Introduction | p. xvii | |
Acknowledgments | p. xxv | |
Part I | Classical Cryptology | |
1 | Ancient Roots | p. 3 |
1.1 | Caveman Crypto | p. 3 |
1.2 | Greek Cryptography | p. 4 |
1.2.1 | Skytale Cipher | p. 4 |
1.2.2 | Polybius Cipher | p. 5 |
1.3 | Viking Cryptography | p. 6 |
1.4 | Early Steganography | p. 7 |
References and Further Reading | p. 8 | |
2 | Monalphabetic Substitution Ciphers, or MASCs: Disguises for Messages | p. 11 |
2.1 | Caesar Cipher | p. 11 |
2.2 | Other MASC Systems | p. 12 |
2.3 | Edgar Allan Poe | p. 15 |
2.4 | Arthur Conan Doyle | p. 20 |
2.5 | Frequency Analysis | p. 22 |
2.6 | Biblical Cryptology | p. 25 |
2.7 | More Frequencies and Pattern Words | p. 26 |
2.8 | Vowel Recognition Algorithms | p. 30 |
2.8.1 | Sukhotin's Method | p. 30 |
2.9 | More MASCs | p. 33 |
2.10 | Cryptanalysis of a MASC | p. 36 |
2.11 | Unsolved Ciphers by a Killer and a Composer | p. 38 |
2.12 | Affine Ciphers | p. 41 |
2.13 | Morse Code and Huffman Coding | p. 46 |
2.14 | MASC Miscellanea | p. 51 |
2.15 | Nomenclators | p. 53 |
2.16 | Cryptanalysis of Nomenclators | p. 55 |
2.17 | Book Codes | p. 58 |
References and Further Reading | p. 61 | |
3 | Simple Progression to an Unbreakable Cipher | p. 69 |
3.1 | Vigenère Cipher | p. 69 |
3.2 | History of the Vigenère Cipher | p. 71 |
3.3 | Cryptanalysis of the Vigenère Cipher | p. 75 |
3.4 | Kryptos | p. 85 |
3.5 | Autokeys | p. 90 |
3.6 | Running Key Cipher and Its Cryptanalysis | p. 91 |
3.7 | One-Time Pad or Vernam Cipher | p. 103 |
3.8 | Breaking the Unbreakable | p. 106 |
3.9 | Faking Randomness | p. 110 |
3.10 | Unsolved Cipher from 1915 | p. 113 |
3.11 | OTPs and the SOE | p. 113 |
3.12 | History Rewritten! | p. 114 |
References and Further Reading | p. 115 | |
4 | Transposition Ciphers | p. 119 |
4.1 | Simple Rearrangements and Columnar Transposition | p. 119 |
4.1.1 | Rail-Fence Transposition | p. 119 |
4.1.2 | Rectangular Transposition | p. 120 |
4.1.3 | More Transposition Paths | p. 122 |
4.2 | Cryptanalysis of Columnar Transposition | p. 124 |
4.3 | Historic Uses | p. 128 |
4.4 | Anagrams | p. 131 |
4.5 | Double Transposition | p. 134 |
4.6 | Word Transposition | p. 136 |
4.6.1 | Civil War Reenactors | p. 138 |
4.7 | Transposition Devices | p. 138 |
References and Further Reading | p. 142 | |
5 | Shakespeare, Jefferson, and JFK | p. 145 |
5.1 | Shakespeare vs. Bacon | p. 145 |
5.2 | Thomas Jefferson: President, Cryptographer | p. 150 |
5.3 | Cipher Wheel Cryptanalysis | p. 153 |
5.4 | Playfair Cipher | p. 166 |
5.5 | Playfair Cryptanalysis | p. 172 |
5.5.1 | Computer Cryptanalysis | p. 177 |
5.6 | Kerckhoffs' Rules | p. 178 |
References and Further Reading | p. 180 | |
6 | World War I and Herbert O. Yardley | p. 185 |
6.1 | Zimmermann Telegram | p. 185 |
6.2 | ADFCX: A New Kind of Cipher | p. 188 |
6.3 | Cryptanalysis of ADFGX | p. 190 |
6.4 | Herbert O. Yardley | p. 207 |
6.5 | Peacetime Victory and a Tell-All Book | p. 211 |
6.6 | The Case of the Seized Manuscript | p. 214 |
6.7 | Cashing in, Again | p. 214 |
6.8 | Herbert O. Yardley: Traitor? | p. 217 |
6.9 | Censorship | p. 219 |
References and Further Reading | p. 223 | |
7 | Matrix Encryption | p. 227 |
7.1 | Levine and Hill | p. 227 |
7.2 | How Matrix Encryption Works | p. 229 |
7.3 | Levine's Attacks | p. 231 |
7.4 | Bauer and Millward's Attack | p. 235 |
7.5 | More Stories Left to Tell | p. 240 |
References and Further Reading | p. 240 | |
8 | World War II: The Enigma of Germany | p. 245 |
8.1 | Rise of the Machines | p. 245 |
8.2 | How Enigma Works | p. 248 |
8.3 | Calculating the Keyspace | p. 254 |
8.4 | Cryptanalysis Part 1. Recovering the Rotor Wirings | p. 256 |
8.5 | Cryptanalysis Part 2. Recovering the Daily Keys | p. 274 |
8.6 | After the Break | p. 278 |
8.7 | Alan Turing and Bletchley Park | p. 278 |
8.8 | Lorenz Cipher and Colossus | p. 283 |
8.9 | What if Enigma Had Never Been Broken? | p. 285 |
8.10 | Endings and New Beginnings | p. 286 |
References and Further Reading | p. 289 | |
9 | Cryptologic War against Japan | p. 293 |
9.1 | Forewarning of Pearl Harbor | p. 293 |
9.2 | Friedman's Team Assembles | p. 294 |
9.3 | Cryptanalysis of Red, a Japanese Diplomatic Cipher | p. 296 |
9.3.1 | Orange | p. 301 |
9.4 | Purple: How It Works | p. 301 |
9.5 | Purple Cryptanalysis | p. 304 |
9.6 | Practical Magic | p. 307 |
9.7 | Code Talkers | p. 311 |
9.8 | Code Talkers in Hollywood | p. 319 |
9.9 | Use of Languages as Oral Codes | p. 321 |
References and Further Reading | p. 322 | |
Part II | Modern Cryptology | |
10 | Claude Shannon | p. 329 |
10.2 | Entropy | p. 330 |
10.3 | One More Time | p. 335 |
10.4 | Unicity Points | p. 337 |
10.5 | Dazed and Confused | p. 337 |
References and Further Reading | p. 338 | |
11 | National Security Agency | p. 341 |
11.1 | Origins of NSA | p. 342 |
11.2 | TEMPEST | p. 342 |
11.3 | Size and Budget | p. 345 |
11.4 | The Liberty and the Pueblo | p. 346 |
11.5 | Church Committee Investigations | p. 349 |
11.6 | Post Cold War Downsizing | p. 353 |
11.7 | Some Speculation | p. 354 |
11.8 | 2000 and Beyond | p. 357 |
11.9 | Interviewing with NSA | p. 359 |
11.10 | BRUSA, UKUSA, and Echelon | p. 362 |
References and Further Reading | p. 364 | |
12 | Data Encryption Standard | p. 369 |
12.1 | How DES Works | p. 369 |
12.2 | Reactions to and Cryptanalysis of DES | p. 380 |
12.2.1 | Objection 1: Key Size Matters | p. 380 |
12.2.2 | Objection 2: S-Box Secrecy | p. 383 |
12.2.3 | S-Boxes Revealed! | p. 384 |
12.3 | EFF vs. DES | p. 385 |
12.4 | Second Chance | p. 388 |
12.5 | Interesting Feature | p. 390 |
12.5.1 | Cryptologic Humor | p. 393 |
12.6 | Modes of Encryption | p. 393 |
12.6.1 | Levine's Methods | p. 393 |
12.6.2 | Modern Modes | p. 395 |
References and Further Reading | p. 399 | |
13 | Birth of Public Key Cryptography | p. 403 |
13.1 | Revolutionary Cryptologist | p. 403 |
13.2 | Diffie-Hellman Key Exchange | p. 404 |
13.3 | RSA: Solution from MIT | p. 407 |
13.3.1 | Fermat's Little Theorem (1640) | p. 409 |
13.3.2 | Euclidean Algorithm | p. 410 |
13.4 | Government Control of Cryptologic Research | p. 414 |
13.5 | RSA Patented, Alice and Bob Born Free | p. 422 |
References and Further Reading | p. 424 | |
14 | Attacking RSA | p. 427 |
14.1 | Eleven Non-Factoring Attacks | p. 427 |
14.1.1 | Attack 1. Common Modulus Attack | p. 427 |
14.1.2 | Attack 2. Man-in-the-Middle | p. 428 |
14.1.3 | Attack 3. Low Decryption Exponent | p. 429 |
14.1.4 | Attack 4. Partial Knowledge of p or q | p. 432 |
14.1.5 | Attack 5. Partial Knowledge of d | p. 432 |
14.1.6 | Attack 6. Low Encryption Exponent Attack | p. 432 |
14.1.7 | Attack 7. Common Enciphering Exponent Attack | p. 432 |
14.1.8 | Attack 8. Searching the Message Space | p. 435 |
14.1.9 | Attack 9. Adaptive Chosen Ciphertext Attacks | p. 435 |
14.1.10 | Attack 10. Timing Attack | p. 436 |
14.1.11 | Attack 11. Ron Was Wrong, Whit Is Right Attack | p. 437 |
14.2 | Factoring Challenge | p. 439 |
14.2.1 | Old Problem | p. 440 |
14.3 | Trial Division and the Sieve of Eratosthenes (ca. 284-204 BCE) | p. 440 |
14.4 | Fermat's Factorization Method | p. 444 |
14.5 | Euler's Factorization Method | p. 445 |
14.6 | Pollard's p-1 Algorithm | p. 447 |
14.7 | Dixon's Algorithm | p. 448 |
14.7.1 | Quadratic Sieve | p. 454 |
14.8 | Pollard's Number Field Sieve | p. 455 |
14.8.1 | Other Methods | p. 456 |
14.8.2 | Cryptological Humor | p. 456 |
References and Further Reading | p. 456 | |
15 | Primality Testing and Complexity Theory | p. 459 |
15.1 | Some Facts about Primes | p. 459 |
15.2 | Fermat Test | p. 462 |
15.3 | Miller-Rabin Test | p. 465 |
15.3.1 | Generating Primes | p. 467 |
15.4 | Deterministic Tests for Primality | p. 467 |
15.4.1 | AKS Primality Test (2002) | p. 468 |
15.4.2 | GIMPS | p. 471 |
15.5 | Complexity Classes, P vs. NP, Probabilistic vs. Deterministic | p. 472 |
15.5.1 | Cryptologic Humor | p. 475 |
15.6 | Ralph Merkle's Public Key Systems | p. 475 |
15.7 | Knapsack Encryption | p. 479 |
15.8 | Elgamal Encryption | p. 482 |
References and Further Reading | p. 485 | |
16 | Authenticity | p. 489 |
16.1 | Problem from World War II | p. 489 |
16.2 | Digital Signatures (and Some Attacks) | p. 490 |
16.2.1 | Attack 12. Chosen Ciphertext Attack | p. 492 |
16.2.2 | Attack 13. Insider's Factoring Attack on the Common Modulus | p. 492 |
16.2.3 | Attack 14. Insider's Nonfactoring Attack | p. 493 |
16.2.4 | Elgamal Signatures | p. 494 |
16.3 | Hash Functions: Speeding Things Up | p. 495 |
16.3.1 | Rivest's MD5 and NIST's SHA-1 | p. 496 |
16.4 | Digital Signature Algorithm | p. 499 |
References and Further Reading | p. 501 | |
17 | Pretty Good Privacy | p. 503 |
17.1 | Best of Both Worlds | p. 503 |
17.2 | Birth of PGP | p. 504 |
17.3 | In Zimmermann's Own Words | p. 509 |
17.4 | Impact of PGP | p. 513 |
17.5 | Implementation Issues | p. 514 |
References and Further Reading | p. 516 | |
18 | Stream Ciphers | p. 519 |
18.1 | Congruential Generators | p. 519 |
18.2 | Linear Feedback Shift Registers | p. 521 |
18.3 | LFSR Attack | p. 523 |
18.4 | Cellphone Stream Cipher A5/1 | p. 525 |
18.5 | RC4 | p. 526 |
References and Further Reading | p. 529 | |
19 | Suite B All-Stars | p. 533 |
19.1 | Elliptic Curve Cryptography | p. 533 |
19.1.1 | Elgamal, ECC Style | p. 540 |
19.2 | Personalities behind ECC | p. 541 |
19.3 | Advanced Encryption Standard (AES) | p. 543 |
19.3.1 | SubBytes | p. 546 |
19.3.2 | ShiftRows | p. 550 |
19.3.3 | MixColumns | p. 550 |
19.3.4 | AddRoundKey | p. 552 |
19.3.5 | Putting It All Together: How AES-128 Works | p. 553 |
19.4 | AES Attacks | p. 553 |
19.5 | Security Guru Bruce Schneier | p. 554 |
References and Further Reading | p. 555 | |
20 | Possible Futures | p. 559 |
20.1 | Quantum Cryptography: How It Works | p. 559 |
20.2 | Quantum Cryptography: Historical Background | p. 561 |
20.3 | DNA Computing | p. 566 |
References and Further Reading | p. 571 | |
Index | p. 575 |