Introduction to modern cryptography
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.
PrivateKey Symmetric Cryptography
Message Authentication Codes and CollisionResistant Hash
13 weitere Abschnitte werden nicht angezeigt.
Andere Ausgaben - Alle anzeigen
Alice arbitrary assume assumption 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 Gen(ln GenModulus GenRSA given hard relative hard-core predicate implies indistinguishable encryptions integer invertible message authentication codes mod TV modulo TV 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 sender signature scheme square roots textbook RSA theorem tion trapdoor permutations uniformly at random Vrfy