Hans Delfs

Indeholder "1. Introduction", " 1.1 Encryption and Secrecy", " 1.2 The Objectives of Cryptography", " 1.3 Attacks", " 1.4 Cryptographic Protocols", " 1.5 Provable Security", "2. Symmetric-Key Encryption", " 2.1 Stream Ciphers", " 2.2 Block Ciphers", " 2.2.1 DES", " 2.2.2 Modes of Operation", "3. Public-Key Cryptography", " 3.1 The Concept of Public-Key Cryptography", " 3.2 Modular Arithmetic", " 3.2.1 The Integers", " 3.2.2 The Integers Modulo n", " 3.3 RSA", " 3.3.1 Key Generation and Encryption", " 3.3.2 Digital Signatures", " 3.3.3 Attacks Against RSA", " 3.3.4 The Secure Application of RSA Encryption", " 3.4 Hash Functions", " 3.4.1 Merkle's Meta Method", " 3.4.2 Construction of Hash Functions", " 3.4.3 Probabilistic Signatures", " 3.5 The Discrete Logarithm", " 3.5.1 ElGamal's Encryption", " 3.5.2 ElGamal's Signature Scheme", " 3.5.3 Digital Signature Algorithm", " 3.6 Modular Squaring", " 3.6.1 Rabin's Encryption", " 3.6.2 Rabin's Signature Scheme", "4. Cryptographic Protocols", " 4.1 Key Exchange and Entity Authentication", " 4.1.1 Kerberos", " 4.1.2 Diffie-Hellman Key Agreement", " 4.1.3 Key Exchange and Mutual Authentication", " 4.1.4 Station-to-Station Protocol", " 4.1.5 Public-Key Management Techniques", " 4.2 Identification Schemes", " 4.2.1 Interactive Proof Systems", " 4.2.2 Simplified Fiat-Shamir Identification Scheme", " 4.2.3 Zero-Knowledge", " 4.2.4 Fiat-Shamir Identification Scheme", " 4.2.5 Fiat-Shamir Signature Scheme", " 4.3 Commitment Schemes", " 4.3.1 A Commitment Scheme Based on Quadratic Residues", " 4.3.2 A Commitment Scheme Based on Discrete Logarithms", " 4.3.3 Homomorphic Commitments", " 4.4 Electronic Elections", " 4.4.1 Secret Sharing", " 4.4.2 A Multi-Authority Election Scheme", " 4.4.3 Proofs of Knowledge", " 4.4.4 Non-Interactive Proofs of Knowledge", " 4.4.5 Extension to Multi-Way Elections", " 4.4.6 Eliminating the Trusted Center", " 4.5 Digital Cash", " 4.5.1 Blindly Issued Proofs", " 4.5.2 A Fair Electronic Cash System", " 4.5.3 Underlying Problems", "5. Probabilistic Algorithms", " 5.1 Coin-Tossing Algorithms", " 5.2 Monte Carlo and Las Vegas Algorithms", "6. One-Way Functions and the Basic Assumptions", " 6.1 A Notation for Probabilities", " 6.2 Discrete Exponential Function", " 6.3 Uniform Sampling Algorithms", " 6.4 Modular Powers", " 6.5 Modular Squaring", " 6.6 Quadratic Residuosity Property", " 6.7 Formal Definition of One-Way Functions", " 6.8 Hard-Core Predicates", "7. Bit Security of One-Way Functions", " 7.1 Bit Security of the Exp Family", " 7.2 Bit Security of the RSA Family", " 7.3 Bit Security of the Square Family", "8. One-Way Functions and Pseudorandomness", " 8.1 Computationally Perfect Pseudorandom Bit Generators", " 8.2 Yao's Theorem", "9. Provably Secure Encryption", " 9.1 Classical Information-Theoretic Security", " 9.2 Perfect Secrecy and Probabilistic Attacks", " 9.3 Public-Key One-Time Pads", " 9.4 Computationally Secret Encryption Schemes", " 9.5 Unconditional Security of Cryptosystems", " 9.5.1 The Bounded Storage Model", " 9.5.2 The Noisy Channel Model", "10. Provably Secure Digital Signatures", " 10.1 Attacks and Levels of Security", " 10.2 Claw-Free Pairs and Collision-Resistant Hash Functions", " 10.3 Authentication-Tree-Based Signatures", " 10.4 A State-Free Signature Scheme", "A. Algebra and Number Theory", " A.1 The Integers", " A.2 Residues", " A.3 The Chinese Remainder Theorem", " A.4 Primitive Roots and the Discrete Logarithm", " A.5 Quadratic Residues", " A.6 Modular Square Roots", " A.7 Primes and Primality Tests", "B. Probabilities and Information Theory", " B.1 Finite Probability Spaces and Random Variables", " B.2 The Weak Law of Large Numbers", " B.3 Distance Measures", " B.4 Basic Concepts of Information Theory", "References", "Index".
???

Hans Delfs har en Ph.D. fra Universität Regensburg, 1981, Tyskland, med en afhandling Kohomologie affiner semialgebraischer Räume med Manfred Knebusch som vejleder, så han er nok tysk.… (plus d'informations)

Indeholder "1. Introduction", "1.1 Encryption and Secrecy", "1.2 The Objectives of Cryptography", "1.3 Attacks", "1.4 Cryptographic Protocols", "1.5 Provable Security", "2. Symmetric-Key Encryption", "2.1 Stream Ciphers", "2.2 Block Ciphers", "2.2.1 DES", "2.2.2 AES", "2.2.3 Modes of Operation", "3. Public-Key Cryptography", "3.1 The Concept of Public-Key Cryptography", "3.2 Modular Arithmetic", "3.2.1 The Integers", "3.2.2 The Integers Modulo n", "3.3 RSA", "3.3.1 Key Generation and Encryption", "3.3.2 Digital Signatures", "3.3.3 Attacks Against RSA", "3.3.4 Probabilistic RSA Encryption", "3.4 Cryptographic Hash Functions", "3.4.1 Security Requirements for Hash Functions", "3.4.2 Construction of Hash Functions", "3.4.3 Data Integrity and Message Authentication", "3.4.4 Hash Functions as Random Functions", "3.4.5 Signatures with Hash Functions", "3.5 The Discrete Logarithm", "3.5.1 ElGamal's Encryption", "3.5.2 ElGamal's Signature Scheme", "3.5.3 Digital Signature Algorithm", "3.6 Modular Squaring", "3.6.1 Rabin's Encryption", "3.6.2 Rabin's Signature Scheme", "4. Cryptographic Protocols", "4.1 Key Exchange and Entity Authentication", "4.1.1 Kerberos", "4.1.2 Diffie-Hellman Key Agreement", "4.1.3 Key Exchange and Mutual Authentication", "4.1.4 Station-to-Station Protocol", "4.1.5 Public-Key Management Techniques", "4.2 Identification Schemes", "4.2.1 Interactive Proof Systems", "4.2.2 Simplified Fiat-Shamir Identification Scheme", "4.2.3 Zero-Knowledge", "4.2.4 Fiat-Shamir Identification Scheme", "4.2.5 Fiat-Shamir Signature Scheme", "4.3 Commitment Schemes", "4.3.1 A Commitment Scheme Based on Quadratic Residues", "4.3.2 A Commitment Scheme Based on Discrete Logarithms", "4.3.3 Homomorphic Commitments", "4.4 Electronic Elections", "4.4.1 Secret Sharing", "4.4.2 A Multi-Authority Election Scheme", "4.4.3 Proofs of Knowledge", "4.4.4 Non-Interactive Proofs of Knowledge", "4.4.5 Extension to Multi-Way Elections", "4.4.6 Eliminating the Trusted Center", "4.5 Digital Cash", "4.5.1 Blindly Issued Proofs", "4.5.2 A Fair Electronic Cash System", "4.5.3 Underlying Problems", "5. Probabilistic Algorithms", "5.1 Coin-Tossing Algorithms", "5.2 Monte Carlo and Las Vegas Algorithms", "6. One-Way Functions and the Basic Assumptions", "6.1 A Notation for Probabilities", "6.2 Discrete Exponential Function", "6.3 Uniform Sampling Algorithms", "6.4 Modular Powers", "6.5 Modular Squaring", "6.6 Quadratic Residuosity Property", "6.7 Formal Definition of One-Way Functions", "6.8 Hard-Core Predicates", "7. Bit Security of One-Way Functions", "7.1 Bit Security of the Exp Family", "7.2 Bit Security of the RSA Family", "7.3 Bit Security of the Square Family", "8. One-Way Functions and Pseudorandomness", "8.1 Computationally Perfect Pseudorandom Bit Generators", "8.2 Yao's Theorem", "9. Provably Secure Encryption", "9.1 Classical Information-Theoretic Security", "9.2 Perfect Secrecy and Probabilistic Attacks", "9.3 Public-Key One-Time Pads", "9.4 Passive Eavesdroppers", "9.5 Chosen-Ciphertext Attacks", "9.5.1 A Security Proof in the Random Oracle Model", "9.5.2 Security Under Standard Assumptions", "9.6 Unconditional Security of Cryptosystems", "9.6.1 The Bounded Storage Model", "9.6.2 The Noisy Channel Model", "10. Provably Secure Digital Signatures", "10.1 Attacks and Levels of Security", "10.2 Claw-Free Pairs and Collision-Resistant Hash Functions", "10.3 Authentication-Tree-Based Signatures", "10.4 A State-Free Signature Scheme", "A. Algebra and Number Theory", "A.1 The Integers", "A.2 Residues", "A.3 The Chinese Remainder Theorem", "A.4 Primitive Roots and the Discrete Logarithm", "A.5 Polynomials and Finite Fields", "A.5.1 The Ring of Polynomials", "A.5.2 Residue Class Rings", "A.5.3 Finite Fields", "A.6 Quadratic Residues", "A.7 Modular Square Roots", "A.8 Primes and Primality Tests", "B. Probabilities and Information Theory", "B.1 Finite Probability Spaces and Random Variables", "B.2 The Weak Law of Large Numbers", "B.3 Distance Measures", "B.4 Basic Concepts of Information Theory", "References", "Index".

???… (plus d'informations)