Cryptography: Theory and Practice, Third Edition(Discrete Mathematics and Its Applications)

Cryptography is an outstanding book that covers all the major areas of cryptography in a readable, mathematically precise form. Several chapters deal with especially active areas of research and give the reader a quick introduction and overview of the basic results in the area. Cryptography provides the mathematical theory that is necessary in order to understand how the various systems work. Most algorithms are presented in the form of pseudocode, together with examples and informal discussion of the underlying ideas. The book gives careful and comprehensive treatment of all the essential core areas of cryptography. Also, several chapters present recent topics that have not received thorough treatment in previous textbooks. Such topics include authentication codes, secret sharing schemes, identification schemes, and key distribution.

Table of Contents:
CLASSICAL CRYPTOGRAPHY Introduction: Some Simple Cryptosystems Cryptanalysis Notes Exercises SHANNON'S THEORY Perfect Secrecy Entropy Properties of Entropy Spurious Keys and Unicity Distance Product Cryptosystems Notes Exercises THE DATA ENCRYPTION STANDARD Introduction Description of DES The DES Controversy DES in Practice A Time-Memory Trade-Off Differential Cryptanalysis Notes and References Exercises THE RSA SYSTEM AND FACTORING Introduction to Public-Key Cryptography More Number Theory The RSA Cryptosystem Implementing RSA Probabilistic Primality Testing Attacks on RSA The Rabin Cryptosystem Factoring Algorithms Notes and References Exercises OTHER PUBLIC-KEY CRYPTOSYSTEMS The ElGamal System and Discrete Logs Finite Field and Elliptic Curve Systems The Merkle-Hellman Knapsack System The McEliece System Notes and References Exercises SIGNATURE SCHEMES Introduction The ElGamal Signature Scheme The Digital Signature Standard One-Time Signatures Undeniable Signatures Fail-Stop Signatures Notes and References Exercises HASH FUNCTIONS Signatures and Hash Functions Collision-Free Hash Functions The Birthday Attack A Discrete Log Hash Function Extending Hash Functions Hash Functions from Cryptosystems The MD4 Hash Function Timestamping Notes and References Exercises KEY DISTRIBUTION AND KEY AGREEMENT Introduction Key Predistribution Kerberos Diffie-Hellman Key Exchange Notes and References IDENTIFICATION SCHEMES Introduction The Schnorr Identification Scheme The Okamoto Identification Scheme The Guillou-Quisquater Identification Scheme Converting Identification to Signature Schemes Notes and References Exercises AUTHENTICATION CODES Introduction Computing Deception Probabilities Combinatorial Bounds Entropy Bounds Notes and References Exercises SECRET SHARING SCHEMES Introduction: The Shamir Threshold Scheme Access Structures and General Secret Sharing The Monotone Circuit Construction Formal Definitions Information Rate The Brickell Vector Space Construction An Upper Bound on the Information Rate The Decomposition Construction Notes and References Exercises PSEUDO-RANDOM NUMBER GENERATION Introduction and Examples Indistinguishable Probability Distributions The Blum-Blum-Shub Generator Probabilistic Encryption Notes and References Exercises ZERO-KNOWLEDGE PROOFS Interactive Proof Systems Perfect Zero-Knowledge Proofs Bit Commitments Computational Zero-Knowledge Proofs Notes and References Exercises