## Introduction to Modern Cryptography: Principles and ProtocolsCryptography 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. |

### What people are saying - Write a review

#### Review: Introduction to Modern Cryptography

User Review - Matthew Talbert - Goodreadsgreat book. easier to understand if you've studied discrete math Read full review

#### Review: Introduction to Modern Cryptography

User Review - Hardik - Goodreadsnice book Read full review

### Common terms and phrases

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 discrete logarithm problem discussion distribution eavesdropper efficient exactly example exists a negligible experiment factoring fixed-length formal function f Gen,Enc,Dec GenModulus GenRSA given hard relative hard-core predicate implies indistinguishable encryptions input 1n integer invertible message authentication codes mod q modp 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 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