Introduction to Modern Cryptography: Principles and ProtocolsCRC Press, 31.08.2007 - 552 Seiten Cryptography plays a key role in ensuring the privacy and integrity of data and the security of computer networks. Introduction to Modern Cryptography provides a rigorous yet accessible treatment of modern cryptography, with a focus on formal definitions, precise assumptions, and rigorous proofs. The authors introduce the core principles of |
Inhalt
Chapter 1 Introduction | 3 |
Chapter 2 PerfectlySecret Encryption | 29 |
Part II PrivateKey Symmetric Cryptography | 45 |
Chapter 3 PrivateKey Encryption and Pseudorandomness | 47 |
Chapter 4 Message Authentication Codes and CollisionResistant Hash Functions | 111 |
Chapter 5 Practical Constructions of Pseudorandom Permutations Block Ciphers | 159 |
Chapter 6 Theoretical Constructions of Pseudorandom Objects | 193 |
Part III PublicKey Asymmetric Cryptography | 241 |
Chapter 10 PublicKey Encryption | 333 |
Chapter 11Additional PublicKey Encryption Schemes | 385 |
Chapter 12 Digital Signature Schemes | 421 |
Chapter 13 PublicKey Cryptosystems in the Random Oracle Model | 457 |
| 489 | |
Appendix A Mathematical Background | 493 |
Appendix B Supplementary Algorithmic Number Theory | 499 |
References | 517 |
Chapter 7 Number Theory and Cryptographic Hardness Assumptions | 243 |
Chapter 8Algorithms for Factoring and Computing Discrete Logarithms | 297 |
Chapter 9 PrivateKey Management and the PublicKey Revolution | 315 |
Back cover | 529 |
Andere Ausgaben - Alle anzeigen
Introduction to Modern Cryptography: Principles and Protocols Jonathan Katz,Yehuda Lindell Eingeschränkte Leseprobe - 2007 |
Häufige Begriffe und Wortgruppen
Alice arbitrary assume assumption bits block cipher chapter choose a random chosen uniformly chosen-ciphertext attack chosen-plaintext attack ciphertext collision-resistant hash function compute construction CPA-secure cryptography decryption oracle defined denote discussion distribution eavesdropper efficient Enck exactly example exists a negligible experiment factoring fixed-length formal function f GenModulus GenRSA given hard relative hard-core predicate implies indistinguishable encryptions input 1n integer invertible message authentication code mod q multiple n-bit negl(n negligible function obtain one-way function oracle queries output plaintext possible prime private-key encryption scheme probabilistic polynomial-time algorithm problem is hard proof of security Proposition protocol prove pseudorandom function pseudorandom permutation public key public key pk public-key encryption scheme quadratic residue quadratic residue modulo random function random oracle model RSA problem S-boxes secret key Section security parameter signature scheme square roots textbook RSA theorem tion trapdoor permutations uniformly at random