Modern Cryptography - Theory and Practice: Phần 1

Part 1 Pc Underground give readers the knowledge overview: beginning with a simple communication game, wrestling between safeguard and attack, probability and information theory, computational complexity, algebraic foundations,... Invite you to consult.
Nội dung trích xuất từ tài liệu:
Modern Cryptography - Theory and Practice: Phần 1 • Table of Contents Modern Cryptography: Theory and Practice ByWenbo Mao Hewlett-Packard Company Publisher: Prentice Hall PTR Pub Date: July 25, 2003 ISBN: 0-13-066943-1 Pages: 648 Many cryptographic schemes and protocols, especially those based on public-keycryptography, have basic or so-called textbook crypto versions, as these versionsare usually the subjects for many textbooks on cryptography. This book takes adifferent approach to introducing cryptography: it pays much more attention tofit-for-application aspects of cryptography. It explains why textbook crypto isonly good in an ideal world where data are random and bad guys behave nicely.It reveals the general unfitness of textbook crypto for the real world by demonstratingnumerous attacks on such schemes, protocols and systems under variousreal- world application scenarios. This book chooses to introduce a set of practicalcryptographic schemes, protocols and systems, many of them standards or de factoones, studies them closely, explains their working principles, discusses their practicalusages, and examines their strong (i.e., fit-for-application) security properties, oftenwith security evidence formally established. The book also includes self-containedtheoretical background material that is the foundation for modern cryptography. • Table of Contents Modern Cryptography: Theory and Practice ByWenbo Mao Hewlett-Packard Company Publisher: Prentice Hall PTR Pub Date: July 25, 2003 ISBN: 0-13-066943-1 Pages: 648 Copyright ManyHewlett-Packard® cryptographicProfessional schemes Booksand protocols, especially those based on public-keycryptography, have Abasic or so-called textbook Short Description of the Book crypto versions, as these versionsare usually the subjects for many textbooks on cryptography. This book takes adifferent approach to introducing Preface cryptography: it pays much more attention tofit-for-application aspects of cryptography. It Scope explains why textbook crypto isonly good in an ideal world where data are random and bad Acknowledgements guys behave nicely.It reveals the general unfitness of textbook crypto for the real world by List of Figures demonstratingnumerous attacks on such schemes, protocols and systems under variousreal- worldList application scenarios. of Algorithms, Protocols andThis book chooses to introduce a set of practicalcryptographic Attacks schemes, Part I:protocols Introductionand systems, many of them standards or de factoones, studies them closely, explainsChapter their working principles, 1. Beginning discusses with a Simple theirGame Communication practicalusages, and examines their strong (i.e., fit-for-application) security properties, Section 1.1. A Communication Game oftenwith security evidence formally established. The book also includes self-containedtheoretical background material that is the foundation for Section 1.2. Criteria for Desirable Cryptographic Systems and Protocols modern cryptography. Section 1.3. Chapter Summary Exercises Chapter 2. Wrestling Between Safeguard and Attack Section 2.1. Introduction Section 2.2. Encryption Section 2.3. Vulnerable Environment (the Dolev-Yao Threat Model) Section 2.4. Authentication Servers Section 2.5. Security Properties for Authenticated Key Establishment Section 2.6. Protocols for Authenticated Key Establishment Using Encryption Section 2.7. Chapter Summary Exercises Part II: Mathematical Foundations: Standard Notation Chapter 3. Probability and Information Theory Section 3.1. Introduction Section 3.2. Basic Concept of Probability Section 3.3. Properties Section 3.4. Basic Calculation Section 3.5. Random Variables and their Probability Distributions Section 3.6. Birthday Paradox Section 3.7. Information Theory Section 3.8. Redundancy in Natural Languages Section 3.9. Chapter Summary Exercises Chapter 4. Computational Complexity Section 4.1. Introduction Section 4.2. Turing Machines Section 4.3. Deterministic Polynomial Time • Table of Contents Section 4.4. Probabilistic Polynomial Time Modern Cryptography: Theory and Practice Section 4.5. Non-deterministic Polynomial Time ByWenbo Mao Hewlett-Packard Company Section 4.6. Non-Polynomial Bounds Section 4.7. Polynomial-time Indistinguishability Publisher: Prentice Hall PTR Section 4.8. Theory of Computational Complexity and Modern Cryptography Pub Date: July 25, 2003 Section 4.9. Chapter Summary ISBN: 0-13-066943-1 Exercises Pages: 648 Chapter 5. Algebraic Foundations Section 5.1. Introduction Section 5.2. Groups Section 5.3. Rings and Fields Section 5.4. The Structure of Finite Fields Many cryptographic schemes and protocols, especially those based on public-keycryptography, Section 5.5. Group Constructed Using Points on an Elliptic Curve have basic or so-called textbook crypto versions, as these versionsare usually the subjects for ...