The Mathematics of Secrets

Name: The Mathematics of Secrets | Cryptography from Caesar Ciphers to Digital Encryption
Brand: Princeton University Press
Price: 18.49 EUR
Availability: OnlineOnly

Cryptography from Caesar Ciphers to Digital Encryption

Joshua Holden(Autor*in)

Princeton University Press

1. Auflage

Erschienen am 2. Oktober 2018

392 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-0-691-18455-5 (ISBN)

18,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Person

Inhalt

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

Systemvoraussetzungen

Als PDF speichern Als Link merken