| Cryptography-The People | p. 1 |
| Introductory Synopsis | p. 9 |
| Cryptography and Steganography | p. 9 |
| Semagrams | p. 10 |
| Open Code: Masking | p. 13 |
| Cues | p. 17 |
| Open Code: Veiling by Nulls | p. 19 |
| Open Code: Veiling by Grilles | p. 23 |
| Classification of Cryptographic Methods | p. 24 |
| Aims and Methods of Cryptography | p. 26 |
| The Nature of Cryptography | p. 26 |
| Encryption | p. 32 |
| Cryptosystems | p. 34 |
| Polyphony | p. 36 |
| Character Sets | p. 39 |
| Keys | p. 41 |
| Encryption Steps: Simple Substitution | p. 44 |
| Case y[superscript (1) rightarrow] W (Unipartite Simple Substitutions) | p. 44 |
| Special Case V [leftrightarrowr] V (Permutations) | p. 46 |
| Case V[superscript (1) rightarrow] W[superscript m] (Multipartite Simple Substitutions) | p. 53 |
| The General Case V[superscript (1) rightarrow] W[superscript (m)], Straddling | p. 55 |
| Encryption Steps: Polygraphic Substitution and Coding | p. 58 |
| Case V[superscript 2 rightarrow] W[superscript (m)] (Digraphic Substitutions) | p. 58 |
| Special Cases of Playfair and Delastelle: Tomographic Methods | p. 64 |
| Case V[superscript 3 rightarrow] W[superscript (m)] (Trigraphic Substitutions) | p. 68 |
| The General Case V[superscript (n) rightarrow] W[superscript (m)]: Codes | p. 68 |
| Encryption Steps: Linear Substitution | p. 80 |
| Self-reciprocal Linear Substitutions | p. 82 |
| Homogeneous Linear Substitutions | p. 82 |
| Binary Linear Substitutions | p. 86 |
| General Linear Substitutions | p. 86 |
| Decomposed Linear Substitutions | p. 87 |
| Decimated Alphabets | p. 90 |
| Linear Substitutions with Decimal and Binary Numbers | p. 91 |
| Encryption Steps: Transposition | p. 93 |
| Simplest Methods | p. 93 |
| Columnar Transpositions | p. 98 |
| Anagrams | p. 102 |
| Polyalphabetic Encryption: Families of Alphabets | p. 106 |
| Iterated Substitutions | p. 106 |
| Cyclically Shifted and Rotated Alphabets | p. 107 |
| Rotor Crypto Machines | p. 110 |
| Shifted Standard Alphabets: Vigenere and Beaufort | p. 127 |
| Unrelated Alphabets | p. 131 |
| Polyalphabetic Encryption: Keys | p. 139 |
| Early Methods with Periodic Keys | p. 139 |
| 'Double Key' | p. 141 |
| Vernam Encryption | p. 142 |
| Quasi-nonperiodic Keys | p. 144 |
| Machines that Generate Their Own Key Sequences | p. 145 |
| Off-Line Forming of Key Sequences | p. 156 |
| Nonperiodic Keys | p. 158 |
| Individual, One-Time Keys | p. 161 |
| Key Negotiation and Key Management | p. 165 |
| Composition of Classes of Methods | p. 169 |
| Group Property | p. 169 |
| Superencryption | p. 171 |
| Similarity of Encryption Methods | p. 173 |
| Shannon's 'Pastry Dough Mixing' | p. 174 |
| Confusion and Diffusion by Arithmetical Operations | p. 180 |
| DES and IDEA | p. 184 |
| Open Encryption Key Systems | p. 193 |
| Symmetric and Asymmetric Encryption Methods | p. 194 |
| One-Way Functions | p. 196 |
| RSA Method | p. 203 |
| Cryptanalytic Attack upon RSA | p. 205 |
| Secrecy Versus Authentication | p. 208 |
| Security of Public Key Systems | p. 210 |
| Encryption Security | p. 211 |
| Cryptographic Faults | p. 211 |
| Maxims of Cryptology | p. 220 |
| Shannon's Yardsticks | p. 225 |
| Cryptology and Human Rights | p. 226 |
| Cryptanalysis-The Machinery | p. 233 |
| Exhausting Combinatorial Complexity | p. 237 |
| Monoalphabetic Simple Encryptions | p. 238 |
| Monoalphabetic Polygraphic Encryptions | p. 239 |
| Polyalphabetic Encryptions | p. 241 |
| General Remarks on Combinatorial Complexity | p. 244 |
| Cryptanalysis by Exhaustion | p. 244 |
| Unicity Distance | p. 246 |
| Practical Execution of Exhaustion | p. 248 |
| Mechanizing the Exhaustion | p. 251 |
| Anatomy of Language: Patterns | p. 252 |
| Invariance of Repetition Patterns | p. 252 |
| Exclusion of Encryption Methods | p. 254 |
| Pattern Finding | p. 255 |
| Finding of Polygraphic Patterns | p. 259 |
| The Method of the Probable Word | p. 259 |
| Automatic Exhaustion of the Instantiations of a Pattern | p. 264 |
| Pangrams | p. 266 |
| Polyalphabetic Case: Probable Words | p. 268 |
| Non-Coincidence Exhaustion of Probable Word Position | p. 268 |
| Binary Non-Coincidence Exhaustion | p. 271 |
| The De Viaris Attack | p. 272 |
| Zig-Zag Exhaustion of Probable Word Position | p. 280 |
| The Method of Isomorphs | p. 281 |
| A clever brute force method: EINSing | p. 287 |
| Covert Plaintext-Cryptotext Compromise | p. 288 |
| Anatomy of Language: Frequencies | p. 290 |
| Exclusion of Encryption Methods | p. 290 |
| Invariance of Partitions | p. 291 |
| Intuitive Method: Frequency Profile | p. 293 |
| Frequency Ordering | p. 294 |
| Cliques and Matching of Partitions | p. 297 |
| Optimal Matching | p. 303 |
| Frequency of Multigrams | p. 305 |
| The Combined Method of Frequency Matching | p. 310 |
| Frequency Matching for Polygraphic Substitutions | p. 316 |
| Free-Style Methods | p. 317 |
| Unicity Distance Revisited | p. 318 |
| Kappa and Chi | p. 320 |
| Definition and Invariance of Kappa | p. 320 |
| Definition and Invariance of Chi | p. 323 |
| The Kappa-Chi Theorem | p. 325 |
| The Kappa-Phi Theorem | p. 326 |
| Symmetric Functions of Character Frequencies | p. 328 |
| Periodicity Examination | p. 330 |
| The Kappa Test of Friedman | p. 331 |
| Kappa Test for Multigrams | p. 332 |
| Cryptanalysis by Machines: Searching for a period | p. 333 |
| Kasiski Examination | p. 339 |
| Building a Depth and Phi Test of Kullback | p. 345 |
| Estimating the Period Length | p. 348 |
| Alignment of Accompanying Alphabets | p. 350 |
| Matching the Profile | p. 350 |
| Aligning Against Known Alphabet | p. 354 |
| Chi Test: Mutual Alignment of Accompanying Alphabets | p. 358 |
| Reconstruction of the Primary Alphabet | p. 363 |
| Kerckhoffs' Symmetry of Position | p. 365 |
| Stripping off Superencryption: Difference Method | p. 370 |
| Decryption of Code | p. 373 |
| Reconstruction of the Password | p. 373 |
| Compromises | p. 375 |
| Kerckhoffs' Superimposition | p. 375 |
| Superimposition for Encryptions with a Key Group | p. 377 |
| Colossus | p. 401 |
| Adjustment 'in depth' of Messages | p. 412 |
| Cryptotext-Cryptotext Compromises | p. 419 |
| Cryptotext-Cryptotext Compromise: ENIGMA Indicator Doubling | p. 431 |
| Plaintext-Cryptotext Compromise: Feedback Cycle | p. 448 |
| Linear Basis Analysis | p. 459 |
| Reduction of Linear Polygraphic Substitutions | p. 459 |
| Reconstruction of the Key | p. 460 |
| Reconstruction of a Linear Shift Register | p. 461 |
| Anagramming | p. 464 |
| Transposition | p. 464 |
| Double Columnar Transposition | p. 467 |
| Multiple Anagramming | p. 467 |
| Concluding Remarks | p. 470 |
| Success in Breaking | p. 471 |
| Mode of Operation of the Unauthorized Decryptor | p. 476 |
| Illusory Security | p. 482 |
| Importance of Cryptology | p. 484 |
| Axiomatic Information Theory | p. 487 |
| Bibliography | p. 497 |
| Index | p. 501 |
| Photo Credits | p. 525 |
| Table of Contents provided by Ingram. All Rights Reserved. |