Contemporary Cryptography Second Edition -- Contents -- Foreword -- Preface -- Acknowledgments -- Chapter 1 Introduction -- 1.1 CRYPTOLOGY -- 1.2 CRYPTOGRAPHIC SYSTEMS -- 1.2.1 Classes of Cryptographic Systems -- 1.2.2 Secure Cryptographic Systems -- 1.2.3 Real Security of Secure Cryptosystems -- 1.3 HISTORICAL BACKGROUND INFORMATION -- 1.4 OUTLINE OF THE BOOK -- References -- Chapter 2 Cryptographic Systems -- 2.1 UNKEYED CRYPTOSYSTEMS -- 2.1.1 One-Way Functions -- 2.1.2 Cryptographic Hash Functions -- 2.1.3 Random Bit Generators -- 2.2 SECRET KEY CRYPTOSYSTEMS -- 2.2.1 Symmetric Encryption Systems -- 2.2.2 Message Authentication Codes -- 2.2.3 PRBGs -- 2.2.4 PRFs -- 2.3 PUBLIC KEY CRYPTOSYSTEMS -- 2.3.1 Asymmetric Encryption Systems -- 2.3.2 DSSs -- 2.3.3 Key Agreement -- 2.3.4 Entity Authentication -- 2.3.5 Secure Multiparty Computation -- 2.4 FINAL REMARKS -- References -- Part I UNKEYED CRYPTOSYSTEMS -- Chapter 3 One-Way Functions -- 3.1 INTRODUCTION -- 3.2 CANDIDATE ONE-WAY FUNCTIONS -- 3.2.1 Discrete Exponentiation Function -- 3.2.2 RSA Function -- 3.2.3 Modular Square Function -- 3.3 INTEGER FACTORIZATION ALGORITHMS -- 3.3.1 Special-Purpose Algorithms -- 3.3.2 General-Purpose Algorithms -- 3.3.3 State of the Art -- 3.4 ALGORITHMS FOR COMPUTING DISCRETE LOGARITHMS -- 3.4.1 Generic Algorithms -- 3.4.2 Nongeneric (Special-Purpose) Algorithms -- 3.4.3 State of the Art -- 3.5 HARD-CORE PREDICATES -- 3.6 ELLIPTIC CURVE CRYPTOGRAPHY -- 3.7 FINAL REMARKS -- References -- Chapter 4 Cryptographic Hash Functions -- 4.1 INTRODUCTION -- 4.2 MERKLE-DAMGARD CONSTRUCTION -- 4.3 EXEMPLARY CRYPTOGRAPHIC HASH FUNCTIONS -- 4.3.1 MD4 -- 4.3.2 MD5 -- 4.3.3 SHA-1 -- 4.4 FINAL REMARKS -- References -- Chapter 5 Random Bit Generators -- 5.1 INTRODUCTION -- 5.2 REALIZATIONS AND IMPLEMENTATIONS -- 5.2.1 Hardware-Based Random Bit Generators.

5.2.2 Software-Based Random Bit Generators -- 5.2.3 Deskewing Techniques -- 5.3 STATISTICAL RANDOMNESS TESTING -- 5.4 FINAL REMARKS -- References -- Part II SECRET KEY CRYPTOSYSTEMS -- Chapter 6 Symmetric Encryption Systems -- 6.1 INTRODUCTION -- 6.1.1 Examples -- 6.1.2 Classes of Symmetric Encryption Systems -- 6.1.3 Secure Symmetric Encryption Systems -- 6.1.4 Evaluation Criteria -- 6.2 BLOCK CIPHERS -- 6.2.1 DES -- 6.2.2 AES -- 6.2.3 Modes of Operation -- 6.3 STREAM CIPHERS -- 6.3.1 LFSR-Based Stream Ciphers -- 6.3.2 Other Stream Ciphers -- 6.4 PERFECTLY SECURE ENCRYPTION -- 6.5 FINAL REMARKS -- References -- Chapter 7 Message Authentication Codes -- 7.1 INTRODUCTION -- 7.2 COMPUTATIONALLY SECURE MACS -- 7.2.1 MACs Using Symmetric Encryption Systems -- 7.2.2 MACs Using Keyed Hash Functions -- 7.2.3 MACs Using PRFs -- 7.2.4 MACs Based on Universal Hashing -- 7.3 INFORMATION-THEORETICALLY SECURE MACS -- 7.4 FINAL REMARKS -- References -- Chapter 8 Pseudorandom Bit Generators -- 8.1 INTRODUCTION -- 8.2 EXEMPLARY CONSTRUCTIONS -- 8.3 CRYPTOGRAPHICALLY SECURE PRBGS -- 8.3.1 Blum-Micali PRBG -- 8.3.2 RSA PRBG -- 8.3.3 BBS PRBG -- 8.4 FINAL REMARKS -- References -- Chapter 9 Pseudorandom Functions -- 9.1 INTRODUCTION -- 9.2 CONSTRUCTIONS -- 9.2.1 PRF-Based PRBG -- 9.2.2 PRBG-Based PRF -- 9.3 RANDOM ORACLE MODEL -- 9.4 FINAL REMARKS -- References -- Part III PUBLIC KEYCRYPTOSYSTEMS -- Chapter 9 Pseudorandom Functions -- 9.1 INTRODUCTION -- 9.2 CONSTRUCTIONS -- 9.2.1 PRF-Based PRBG -- 9.2.2 PRBG-Based PRF -- 9.3 RANDOM ORACLE MODEL -- 9.4 FINAL REMARKS -- References -- Part III PUBLIC KEYCRYPTOSYSTEMS -- Chapter 10 Asymmetric Encryption Systems -- 10.1 INTRODUCTION -- 10.2 BASIC SYSTEMS -- 10.2.1 RSA -- 10.2.2 Rabin -- 10.2.3 Elgamal -- 10.3 SECURE SYSTEMS -- 10.3.1 Probabilistic Encryption -- 10.3.2 Optimal Asymmetric Encryption Padding.

10.3.3 Cramer-Shoup -- 10.4 IDENTITY-BASED ENCRYPTION -- 10.5 HOMOMORPHIC ENCRYPTION -- 10.6 FINAL REMARKS -- References -- Chapter 11 Digital Signature Systems -- 11.1 INTRODUCTION -- 11.2 BASIC SYSTEMS -- 11.2.1 RSA -- 11.2.2 Rabin -- 11.2.3 Elgamal -- 11.2.4 Schnorr -- 11.2.5 DSA -- 11.2.6 ECDSA -- 11.3 PROVABLY SECURE SYSTEMS -- 11.3.1 GMR -- 11.3.2 PSS and PSS-R -- 11.3.3 Cramer-Shoup -- 11.3.4 Gennaro-Halevi-Rabin -- 11.4 IDENTITY-BASED SIGNATURES -- 11.5 ONE-TIME SIGNATURES -- 11.6 DIGITAL SIGNATURES FOR STREAMS -- 11.7 VARIANTS -- 11.7.1 Blind Signatures -- 11.7.2 Undeniable Signatures -- 11.7.3 Fail-Stop Signatures -- 11.7.4 Group Signatures -- 11.8 FINAL REMARKS -- References -- Chapter 12 Key Establishment -- 12.1 INTRODUCTION -- 12.2 KEY DISTRIBUTION PROTOCOLS -- 12.2.1 Merkle's Puzzles -- 12.2.2 Shamir's Three-Pass Protocol -- 12.2.3 Asymmetric Encryption-Based Key Distribution Protocol -- 12.3 KEY AGREEMENT PROTOCOLS -- 12.4 QUANTUM CRYPTOGRAPHY -- 12.4.1 Basic Principles -- 12.4.2 Quantum Key Exchange Protocol -- 12.4.3 Historical and Recent Developments -- 12.5 FINAL REMARKS -- References -- Chapter 13 Entity Authentication -- 13.1 INTRODUCTION -- 13.2 AUTHENTICATION TECHNOLOGIES -- 13.2.1 Proof by Possession -- 13.2.2 Proof by Knowledge -- 13.2.3 Proof by Property -- 13.2.4 Proof by Location -- 13.3 ZERO-KNOWLEDGE AUTHENTICATION PROTOCOLS -- 13.3.1 Preliminary Remarks -- 13.3.2 Fiat-Shamir -- 13.3.3 Guillou-Quisquater -- 13.3.4 Schnorr -- 13.3.5 Turning Interactive Proofs of Knowledge into DSSs -- 13.4 FINAL REMARKS -- References -- Chapter 14 Secure Multiparty Computation -- 14.1 INTRODUCTION -- References -- 14.1.1 Communication Models -- 14.1.2 Adversary Models -- 14.1.3 Notions of Security -- 14.2 MAJOR RESULTS -- 14.3 FINAL REMARKS -- Part IV CONCLUSIONS -- Chapter 15 Key Management -- 15.1 INTRODUCTION -- 15.2 KEY LIFE CYCLE.

15.2.1 Key Generation -- 15.2.2 Key Distribution -- 15.2.3 Key Storage -- 15.2.4 Key Destruction -- 15.3 SECRET SHARING -- 15.3.1 Shamir's System -- 15.3.2 Blakley's System -- 15.3.3 Verifiable Secret Sharing -- 15.3.4 Visual Cryptography -- 15.4 KEY RECOVERY -- 15.5 PUBLIC KEY INFRASTRUCTURE -- 15.5.1 PGP Certificates -- 15.5.2 X.509 Certificates -- 15.6 FINAL REMARKS -- References -- Chapter 16 Summary -- 16.1 UNKEYED CRYPTOSYSTEMS -- 16.2 SECRET KEY CRYPTOSYSTEMS -- 16.3 PUBLIC KEY CRYPTOSYSTEMS -- 16.4 FINAL REMARKS -- Chapter 17 Outlook -- 17.1 THEORETICAL VIEWPOINT -- 17.2 PRACTICAL VIEWPOINT -- References -- Appendix A Discrete Mathematics -- A.1 ALGEBRAIC BASICS -- A.1.1 Preliminary Remarks -- A.1.2 Algebraic Sructures -- A.1.3 Homomorphisms and Isomorphisms -- A.1.4 Permutations -- A.2 INTEGER ARITHMETIC -- A.2.1 Integer Division -- A.2.2 Common Divisors and Multiples -- A.2.3 Euclidean Algorithms -- A.2.4 Prime Numbers -- A.2.5 Factorization -- A.2.6 Euler's Totient Function -- A.3 MODULAR ARITHMETIC -- A.3.1 Modular Congruence -- A.3.2 Modular Exponentiation -- A.3.3 Chinese Remainder Theorem -- A.3.4 Fermat's Little Theorem -- A.3.5 Euler's Theorem -- A.3.6 Finite Fields Modulo Irreducible Polynomials -- A.3.7 Quadratic Residuosity -- A.3.8 Blum Integers -- References -- Appendix B Probability Theory -- B.1 BASIC TERMS AND CONCEPTS -- B.2 RANDOM VARIABLES -- B.2.1 Probability Distributions -- B.2.2 Marginal Distributions -- B.2.3 Conditional Probability Distributions -- B.2.4 Expectation -- B.2.5 Independence of Random Variables -- B.2.6 Markov's Inequality -- B.2.7 Variance and Standard Deviation -- B.2.8 Chebyshev's Inequality -- References -- Appendix C Information Theory -- C.1 INTRODUCTION -- C.2 ENTROPY -- C.2.1 Joint Entropy -- C.2.2 Conditional Entropy -- C.2.3 Mutual Information -- C.3 REDUNDANCY.

C.4 KEY EQUIVOCATION AND UNICITY DISTANCE -- References -- Appendix D Complexity Theory -- D.1 PRELIMINARY REMARKS -- D.2 INTRODUCTION -- D.3 ASYMPTOTIC ORDER NOTATION -- D.4 EFFICIENT COMPUTATIONS -- D.5 COMPUTATIONAL MODELS -- D.6 COMPLEXITY CLASSES -- D.6.1 Complexity Class P -- D.6.2 Complexity Classes NP and coNP -- D.6.3 Complexity Class PP and Its Subclasses -- D.7 SHORTCOMINGS AND LIMITATIONS -- References -- List of Symbols -- Abbreviations and Acronyms -- About the Author -- Index.