Introduction to Modern Crytography Jonathan Katz, and Yehuda Lindell
Publication details: Boca Raton, London CRC Press c2021Edition: 3rd EditionDescription: xx, 626 p. ill. 24 cmISBN:- 780815354369
- 9781351133036
- 23 005.8 KAT
Item type | Current library | Call number | Copy number | Status | Date due | Barcode |
---|---|---|---|---|---|---|
Book Closed Access | Engineering Library | 005.8 KAT 1 (Browse shelf(Opens below)) | 1 | Available | BUML24010417 |
Browsing Engineering Library shelves Close shelf browser (Hides shelf browser)
Contents
I. Introduction and Classical Cryptography
1. Introduction
Cryptography and modern Cryptography
The setting of private-Key Encryption
Historical Ciphers and Their Cryptanalysis
Principles of modern Cryptography
2. Perfectly Secret Encryption
Definitions
The one-Time pad
Limitations of perfect secrecy
Shannon's Theorem
II.Private-Key (Symmetric) Cryptography
3. Private-Key Encryption
Computational Security
Defining Computationally Secure Encryption
Constructing an EAV-Secure Encryption scheme
Stronger security Notion
Constructing a CPA-Secure Encryption
etc
4. Message Authentication codes
Message integrity
Message Authentication Code (MACs) Definitions
Constructing message authentication Codes
CBC-MAC
GMAC and Poly1305
etc
5. CCA-Security and Authenticated Encryption
Chosen-Ciphertext Attacks and CCA -security
Authenticated Encryption
Authenticated Encryption Schemes
Secure communication sessions
6. Hash function and applications and Applications
Definitions
Domain Extensions: The Merkel-Damgard Transform
Message Authentication using Hash Function
Generic attack on Hash Function
The random-Oracle Methodology sound
Additional applications of Hash functions
etc
7. Practical Constructions of Symmetric-Key Primitives
Stream Ciphers
Block Ciphers
Compression Functions and Hash functions
8. Theoretical Constructions of Symmetric-Key Primitive
One-Way Function
From One-Way Function of Pseudorandomness
Hard-core Predicates from One-way Function
Constructing Pseudorandom Generator
Constructing Pseudorandom Functions
etc
III. Public- Key (Asymmetric) Cryptography
9.Number Theory and Cryptographic Hardness Assumptions
Preliminaries and basic group Theory
Primes, Factoring and RSA
Cryptographic Assumptions in Cyclic Groups
Cryptographic application
10. Algorithms for factoring and computing discrete Logarithms
Algorithms for factoring
Generic Algorithms for computing Discrete logarithms
Index calculus: Computing Discrete logarithms
11. Key Management and public- Key Revolution
Key Distribution and Key Management
A partial Solution: Key distribution Centers
Key Exchange and the Diffie-Hellman Protocol
The public-Key revolution
12. Public-Key Encryption
Public-Key Encryption - An over Overview
Definition
Hybrid Encryption and the KEM/DEM Paradigm
CDH/DDH-Based Encryption
RSA-Based Encryption
etc
13. Digital Signature Schemes
Digital Signature- Overview
Definition
The hash and sign Paradigm
RSA-Based Signature
Signature from the discrete-Logarithms problem
Certificate and public-Key Cryptography
etc.
14. Post-Quantum Cryptography
Post- Quantum Symmetric-Key Cryptography
Shor's Algorithm and its impact on Cryptography
Post- Quantum Public- Key Encryption
Post- Quantum Signature
15. Advanced Topic in Public-Key Encryption
Public-Key Encryption from Tropdoor Permutations
The Paillier Encryption scheme
Secret sharing
The Goldwasser- Micali Encryption scheme
Include bibliographic References p. 603-618 and index p. 619-626
There are no comments on this title.