Cryptography and Data Security

Indeholder "1. INTRODUCTION", " 1.1 Cryptography", " 1.2 Data Security", " 1.3 Cryptographic Systems", " 1.3.1 Public-Key Systems", " 1.3.2 Digital Signatures", " 1.4 Information Theory", " 1.4.1 Entropy and Equivocation", " 1.4.2 Perfect Secrecy", " 1.4.3 Unicity Distance", " 1.5 Complexity Theory", " 1.5.1 Algorithm Complexity", " 1.5.2 Problem Complexity and NP-Completeness", " 1.5.3 Ciphers Based on Computationally Hard Problems", " 1.6 Number Theory", " 1.6.1 Congruences and Modular Arithmetic", " 1.6.2 Computing Inverses", " 1.6.3 Computing in Galois Fields", " Exercises", " References", "2. ENCRYPTION ALGORITHMS", " 2.1 Transposition Ciphers", " 2.2 Simple Substitution Ciphers", " 2.2.1 Single-Letter Frequency Analysis", " 2.3 Homophonic Substitution Ciphers", " 2.3.1 Beale Ciphers", " 2.3.2 Higher-Order Homophonics", " 2.4 Polyalphabetic Substitution Ciphers", " 2.4.1 Vigenére and Beaufort Ciphers", " 2.4.2 Index of Coincidence", " 2.4.3 Kasiski Method", " 2.4.4 Running-Key Ciphers", " 2.4.5 Rotor and Hagelin Machines", " 2.4.6 Vernam Cipher and One-Time Pads", " 2.5 Polygram Substitution Ciphers", " 2.5.1 Playfair Cipher", " 2.5.2 Hill Cipher", " 2.6 Product Ciphers", " 2.6.1 Substitution-Permutation Ciphers", " 2.6.2 The Data Encryption Standard (DES)", " 2.6.3 Time-Memory Tradeoff", " 2.7 Exponentiation Ciphers", " 2.7.1 Pohlig-Hellman Scheme", " 2.7.2 Rivest-Shamir-Adleman (RSA) Scheme", " 2.7.3 Mental Poker", " 2.7.4 Oblivious Transfer", " 2.8 Knapsack Ciphers", " 2.8.1 Merkle-Hellman Knapsacks", " 2.8.2 Graham-Shamir Knapsacks", " 2.8.3 Shamir Signature-Only Knapsacks", " 2.8.4 A Breakable NP-Complete Knapsack", " Exercises", " References", "3. CRYPTOGRAPHIC TECHNIQUES", " 3.1 Block and Stream Ciphers", " 3.2 Synchronous Stream Ciphers", " 3.2.1 Linear Feedback Shift Registers", " 3.2.2 Output-Block Feedback Mode", " 3.2.3 Counter Method", " 3.3 Self-Synchronous Stream Ciphers", " 3.3.1 Autokey Ciphers", " 3.3.2 Cipher Feedback", " 3.4 Block Ciphers", " 3.4.1 Block Chaining and Cipher Block Chaining", " 3.4.2 Block Ciphers with Subkeys", " 3.5 Endpoints of Encryption", " 3.5.1 End-to-End versus Link Encryption", " 3.5.2 Privacy Homomorphisms", " 3.6 One-Way Ciphers", " 3.6.1 Passwords and User Authentication", " 3.7 Key Management", " 3.7.1 Secret Keys", " 3.7.2 Public Keys", " 3.7.3 Generating Block Encryption Keys", " 3.7.4 Distribution of Session Keys", " 3.8 Threshold Schemes", " 3.8.1 Lagrange Interpolating Polynomial Scheme", " 3.8.2 Congruence Class Scheme", " Exercises", " References", "4. ACCESS CONTROLS", " 4.1 Access-Matrix Model", " 4.1.1 The Protection State", " 4.1.2 State Transitions", " 4.1.3 Protection Policies", " 4.2 Access Control Mechanisms", " 4.2.1 Security and Precision", " 4.2.2 Reliability and Sharing", " 4.2.3 Design Principles", " 4.3 Access Hierarchies", " 4.3.1 Privileged Modes", " 4.3.2 Nested Program Units", " 4.4 Authorization Lists", " 4.4.1 Owned Objects", " 4.4.2 Revocation", " 4.5 Capabilities", " 4.5.1 Domain Switching with Protected Entry Points", " 4.5.2 Abstract Data Types", " 4.5.3 Capability-Based Addressing", " 4.5.4 Revocation", " 4.5.5 Locks and Keys", " 4.5.6 Query Modification", " 4.6 Verifiably Secure Systems", " 4.6.1 Security Kernels", " 4.6.2 Levels of Abstraction", " 4.6.3 Verification", " 4.7 Theory of Safe Systems", " 4.7.1 Mono-Operational Systems", " 4.7.2 General Systems", " 4.7.3 Theories for General Systems", " 4.7.4 Take-Grant Systems", " Exercises", " References", "5. INFORMATION FLOW CONTROLS", " 5.1 Lattice Model of Information Flow", " 5.1.1 Information Flow Policy", " 5.1.2 Information State", " 5.1.3 State Transitions and Information Flow", " 5.1.4 Lattice Structure", " 5.1.5 Flow Properties of Lattices", " 5.2 Flow Control Mechanisms", " 5.2.1 Security and Precision", " 5.2.2 Channels of Flow", " 5.3 Execution-Based Mechanisms", " 5.3.1 Dynamically Enforcing Security for Implicit Flow", " 5.3.2 Flow-Secure Access Controls", " 5.3.3 Data Mark Machine", " 5.3.4 Single Accumulator Machine", " 5.4 Compiler-Based Mechanism", " 5.4.1 Flow Specifications", " 5.4.2 Security Requirements", " 5.4.3 Certification Semantics", " 5.4.4 General Data and Control Structures", " 5.4.5 Concurrency and Synchronization", " 5.4.6 Abnormal Terminations", " 5.5 Program Verification", " 5.5.1 Assignment", " 5.5.2 Compound", " 5.5.3 Alternation", " 5.5.4 Iteration", " 5.5.5 Procedure Call", " 5.5.6 Security", " 5.6 Flow Controls in Practice", " 5.6.1 System Verification", " 5.6.2 Extensions", " 5.6.3 A Guard Application", " Exercises", " References", "6. INFERENCE CONTROLS", " 6.1 Statistical Database Model", " 6.1.1 Information State", " 6.1.2 Types of Statistics", " 6.1.3 Disclosure of Sensitive Statistics", " 6.1.4 Perfect Secrecy and Protection", " 6.1.5 Complexity of Disclosure", " 6.2 Inference Control Mechanisms", " 6.2.1 Security and Precision", " 6.2.2 Methods of Release", " 6.3 Methods of Attack", " 6.3.1 Small and Large Query Set Attacks", " 6.3.2 Tracker Attacks", " 6.3.3 Linear System Attacks", " 6.3.4 Median Attacks", " 6.3.5 Insertion and Deletion Attacks", " 6.4 Mechanisms that Restrict Statistics", " 6.4.1 Cell Suppression", " 6.4.2 Implied Queries", " 6.4.3 Partitioning", " 6.5 Mechanisms that Add Noise", " 6.5.1 Response Perturbation (Rounding)", " 6.5.2 Random-Sample Queries", " 6.5.3 Data Perturbation", " 6.5.4 Data Swapping", " 6.5.5 Randomized Response (Inquiry)", " 6.6 Summary", " Exercises", " References", "INDEX".

Klassisk lærebog i kryptografi, men med 30 år på bagen. Enigma er nævnt kort på side 85 som opfundet af Arthur Scherbius og med en meget kort beskrivelse af virkemåden. ( )