| Introduction | p. 1 |
| Preamble | p. 1 |
| Terminology | p. 3 |
| Historical Perspective | p. 6 |
| Modern Cryptography | p. 8 |
| Background Theory | p. 11 |
| Elements of Number Theory | p. 11 |
| Algebraic Structures in Computing | p. 28 |
| Complexity of Computing | p. 38 |
| Elements of Information Theory | p. 52 |
| Problems and Exercises | p. 66 |
| Private-Key Cryptosystems | p. 69 |
| Classical Ciphers | p. 69 |
| DES Family | p. 89 |
| Modern Private-Key Cryptographic Algorithms | p. 106 |
| Differential Cryptanalysis | p. 122 |
| Linear Cryptanalysis | p. 135 |
| S-box Theory | p. 144 |
| Problems and Exercises | p. 167 |
| Public-Key Cryptosystems | p. 171 |
| Concept of Public-Key Cryptography | p. 171 |
| RSA Cryptosystem | p. 174 |
| Merkle-Hellman Cryptosystem | p. 189 |
| McEliece Cryptosystem | p. 192 |
| ElGamal Cryptosystem | p. 195 |
| Elliptic Cryptosystems | p. 196 |
| Probabilistic Encryption | p. 206 |
| Public-Key Encryption Practice | p. 209 |
| Problems and Exercises | p. 216 |
| Pseudorandomness | p. 219 |
| Number Generators | p. 219 |
| Polynomial Indistinguishability | p. 221 |
| Pseudorandom Bit Generators | p. 224 |
| Next Bit Test | p. 232 |
| Pseudorandom Function Generators | p. 233 |
| Pseudorandom Permutation Generators | p. 238 |
| Super Pseudorandom Permutation Generators | p. 241 |
| Problems and Exercises | p. 242 |
| Hashing | p. 243 |
| Properties of Hashing | p. 243 |
| Birthday Paradox | p. 244 |
| Serial and Parallel Hashing | p. 249 |
| Theoretic Constructions | p. 250 |
| Hashing Based on Cryptosystems | p. 254 |
| MD (Message Digest) Family | p. 256 |
| Keyed Hashing | p. 275 |
| Problems and Exercises | p. 280 |
| Digital Signatures | p. 283 |
| Properties of Digital Signatures | p. 283 |
| Generic Signature Schemes | p. 285 |
| RSA Signatures | p. 288 |
| ElGamal Signatures | p. 290 |
| Blind Signatures | p. 294 |
| Undeniable Signatures | p. 295 |
| Fail-Stop Signatures | p. 299 |
| Timestamping | p. 302 |
| Problems and Exercises | p. 304 |
| Authentication | p. 307 |
| Active Opponents | p. 307 |
| Model of Authentication Systems | p. 309 |
| Information Theoretic Bounds | p. 317 |
| Constructions of A-codes | p. 319 |
| General A-codes | p. 323 |
| Problems and Exercises | p. 324 |
| Secret Sharing | p. 327 |
| Threshold Secret Sharing | p. 327 |
| General Secret Sharing | p. 332 |
| Perfectness | p. 338 |
| Information Rate | p. 340 |
| Extended Capabilities | p. 348 |
| Problems and Exercises | p. 350 |
| Group-Oriented Cryptography | p. 353 |
| Conditionally Secure Shamir Scheme | p. 353 |
| Threshold Decryption | p. 361 |
| Threshold Signatures | p. 368 |
| Problems and Exercises | p. 376 |
| Key Establishment Protocols | p. 379 |
| Classical Key Transport Protocols | p. 381 |
| Diffie-Hellman Key Agreement Protocol | p. 383 |
| Modern Key Distribution Protocols | p. 385 |
| Key Agreement Protocols | p. 393 |
| Conference-Key Establishment Protocols | p. 398 |
| BAN Logic of Authentication | p. 401 |
| Problems and Exercises | p. 407 |
| Zero-Knowledge Proof Systems | p. 409 |
| Interactive Proof Systems | p. 409 |
| Perfect Zero-Knowledge Proofs | p. 413 |
| Computational Zero-Knowledge Proofs | p. 421 |
| Bit Commitment Schemes | p. 424 |
| Problems and Exercises | p. 430 |
| Identification | p. 433 |
| Basic Identification Techniques | p. 433 |
| User Identification | p. 434 |
| Passwords | p. 436 |
| Challenge-Response Identification | p. 440 |
| Identification Protocols | p. 443 |
| Identification Schemes | p. 450 |
| Problems and Exercises | p. 456 |
| Intrusion Detection | p. 459 |
| Introduction | p. 459 |
| Anomaly Intrusion Detection | p. 461 |
| Misuse Intrusion Detection | p. 466 |
| Uncertainty in Intrusion Detection | p. 467 |
| Generic Intrusion Detection Model | p. 473 |
| Host Intrusion Detection Systems | p. 476 |
| Network Intrusion Detection Systems | p. 480 |
| Limitations of Current Intrusion Detection Systems | p. 487 |
| The Common Intrusion Detection Framework (CIDF) | p. 490 |
| Partial List of ID Systems | p. 492 |
| Problems and Exercises | p. 497 |
| Electronic Elections and Digital Money | p. 499 |
| Electronic Elections | p. 499 |
| Digital Cash | p. 509 |
| Payment Protocols | p. 522 |
| Database Protection and Security | p. 525 |
| Database Access Control | p. 525 |
| Security Filters | p. 527 |
| Encryption Methods | p. 529 |
| Database Machines and Architectures | p. 539 |
| Database Views | p. 544 |
| Security in Distributed Databases | p. 551 |
| Security in Object-Oriented Database Systems | p. 554 |
| Security in Knowledge-Based Systems | p. 557 |
| Oracle8 Security | p. 558 |
| Access Control | p. 565 |
| Mandatory Access Control | p. 567 |
| Discretionary Access Control | p. 571 |
| Role-Based Access Control Model | p. 576 |
| Implementations of Access Control | p. 578 |
| Network Security | p. 591 |
| Internet Protocol Security (IPsec) | p. 591 |
| Secure Sockets Layer | p. 602 |
| Computer Viruses | p. 611 |
| References | p. 631 |
| Index | p. 665 |
| Table of Contents provided by Rittenhouse. All Rights Reserved. |
