دانلود کتاب The Mathematics of Secrets: Cryptography from Caesar Ciphers to Digital Encryption

فهرست مطالب :

CONTENTS\nPreface\nAcknowledgments\n1 Introduction to Ciphers and Substitution\n 1.1 Alice and Bob and Carl and Julius: Terminology and Caesar Cipher\n 1.2 The Key to the Matter: Generalizing the Caesar Cipher\n 1.3 Multiplicative Ciphers\n 1.4 Affine Ciphers\n 1.5 Attack at Dawn: Cryptanalysis of Sample Substitution Ciphers\n 1.6 Just to Get Up That Hill: Polygraphic Substitution Ciphers\n 1.7 Known-Plaintext Attacks\n 1.8 Looking Forward\n2 Polyalphabetic Substitution Ciphers\n 2.1 Homophonic Ciphers\n 2.2 Coincidence or Conspiracy?\n 2.3 Alberti Ciphers\n 2.4 It’s Hip to Be Square: Tabula Recta or Vigenère Square Ciphers\n 2.5 How Many Is Many? Determining the Number of Alphabets\n 2.6 Superman Is Staying for Dinner: Superimposition and Reduction\n 2.7 Products of Polyalphabetic Ciphers\n 2.8 Pinwheel Machines and Rotor Machines\n 2.9 Looking Forward\n3 Transposition Ciphers\n 3.1 This Is Sparta! The Scytale\n 3.2 Rails and Routes: Geometric Transposition Ciphers\n 3.3 Permutations and Permutation Ciphers\n 3.4 Permutation Products\n 3.5 Keyed Columnar Transposition Ciphers\n Sidebar 3.1 Functional Nihilism\n 3.6 Determining the Width of the Rectangle\n 3.7 Anagramming\n Sidebar 3.2 But When You Talk about Disruption\n 3.8 Looking Forward\n4 Ciphers and Computers\n 4.1 Bringing Home the Bacon: Polyliteral Ciphers and Binary Numerals\n 4.2 Fractionating Ciphers\n 4.3 How to Design a Digital Cipher: SP-Networks and Feistel Networks\n Sidebar 4.1 Digitizing Plaintext\n 4.4 The Data Encryption Standard\n 4.5 The Advanced Encryption Standard\n 4.6 Looking Forward\n5 Stream Ciphers\n 5.1 Running-Key Ciphers\n Sidebar 5.1 We Have All Been Here Before\n 5.2 One-Time Pads\n 5.3 Baby You Can Drive My Car: Autokey Ciphers\n 5.4 Linear Feedback Shift Registers\n 5.5 Adding Nonlinearity to LFSRs\n 5.6 Looking Forward\n6 Ciphers Involving Exponentiation\n 6.1 Encrypting Using Exponentiation\n 6.2 Fermat’s Little Theorem\n 6.3 Decrypting Using Exponentiation\n 6.4 The Discrete Logarithm Problem\n 6.5 Composite Moduli\n 6.6 The Euler Phi Function\n 6.7 Decryption with Composite Moduli\n Sidebar 6.1 Fee-fi-fo-fum\n 6.8 Looking Forward\n7 Public-Key Ciphers\n 7.1 Right out in Public: The Idea of Public-Key Ciphers\n 7.2 Diffie-Hellman Key Agreement\n 7.3 Asymmetric-Key Cryptography\n 7.4 RSA\n 7.5 Priming the Pump: Primality Testing\n 7.6 Why is RSA a (Good) Public-Key System?\n 7.7 Cryptanalysis of RSA\n 7.8 Looking Forward\n Appendix A The Secret History of Public-Key Cryptography\n8 Other Public-Key Systems\n 8.1 The Three-Pass Protocol\n 8.2 ElGamal\n 8.3 Elliptic Curve Cryptography\n 8.4 Digital Signatures\n 8.5 Looking Forward\n9 The Future of Cryptography\n 9.1 Quantum Computing\n 9.2 Postquantum Cryptography\n 9.3 Quantum Cryptography\n 9.4 Looking Forward\nList of Symbols\nNotes\nSuggestions for Further Reading\nBibliography\nIndex