Introduction to Modern Cryptography: Principles and Protocols
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 modern cryptography, including the modern, computational approach to security that overcomes the limitations of perfect secrecy. An extensive treatment of private-key encryption and message authentication follows. The authors also illustrate design principles for block ciphers, such as the Data Encryption Standard (DES) and the Advanced Encryption Standard (AES), and present provably secure constructions of block ciphers from lower-level primitives. The second half of the book focuses on public-key cryptography, beginning with a self-contained introduction to the number theory needed to understand the RSA, Diffie-Hellman, El Gamal, and other cryptosystems. After exploring public-key encryption and digital signatures, the book concludes with a discussion of the random oracle model and its applications.
Serving as a textbook, a reference, or for self-study, Introduction to Modern Cryptography presents the necessary tools to fully understand this fascinating subject.
Was andere dazu sagen - Rezension schreiben
Es wurden keine Rezensionen gefunden.
Chapter 2 PerfectlySecret Encryption
Part II PrivateKey Symmetric Cryptography
Chapter 3 PrivateKey Encryption and Pseudorandomness
Chapter 4 Message Authentication Codes and CollisionResistant Hash Functions
Chapter 5 Practical Constructions of Pseudorandom Permutations Block Ciphers
Chapter 6 Theoretical Constructions of Pseudorandom Objects
Part III PublicKey Asymmetric Cryptography
Chapter 10 PublicKey Encryption
Chapter 11Additional PublicKey Encryption Schemes
Chapter 12 Digital Signature Schemes
Chapter 13 PublicKey Cryptosystems in the Random Oracle Model
Appendix A Mathematical Background
Appendix B Supplementary Algorithmic Number Theory
Chapter 7 Number Theory and Cryptographic Hardness Assumptions
Chapter 8Algorithms for Factoring and Computing Discrete Logarithms
Chapter 9 PrivateKey Management and the PublicKey Revolution
Andere Ausgaben - Alle anzeigen
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