Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more ➡
Standard view
Full view
of .
×

Introduction
1.1 Goals and settings
1.2 Other goals
1.4 Approaches to the study of cryptography
1.5 What background do I need?
1.6 Problems
Classical Encryption
2.1 Substitution ciphers
2.3 Problems
Blockciphers
3.1 What is a blockcipher?
3.2 Data Encryption Standard (DES)
3.3 Key recovery attacks on blockciphers
3.4 Iterated-DES and DESX
3.6 Limitations of key-recovery based security
3.7 Problems
Pseudorandom Functions
4.1 Function families
4.2 Random functions and permutations
4.3 Pseudorandom functions
4.4 Pseudorandom permutations
4.5 Modeling blockciphers
4.6 Example attacks
4.7 Security against key recovery
4.8 The birthday attack
4.9 The PRP/PRF switching lemma
4.10 Unix one-way function
4.11 Historical notes
4.12 Problems
Symmetric Encryption
5.1 Symmetric encryption schemes
5.2 Some symmetric encryption schemes
5.3 Issues in privacy
5.4 Indistinguishability under chosen-plaintext attack
5.5 Example chosen-plaintext attacks
5.6 Semantic security
5.7 Security of CTR modes
5.8 Security of CBC with a random IV
5.9 Indistinguishability under chosen-ciphertext attack
5.10 Example chosen-ciphertext attacks
5.11 Historical notes
5.12 Problems
Hash Functions
6.1 The hash function SHA1
6.2 Collision-resistant hash functions
6.3 Collision-ﬁnding attacks
6.4 One-wayness of collision-resistant hash functions
7.3 Syntax for message authentication
7.4 Deﬁnitions of security
7.5 Examples
7.7 The CBC MAC
7.8 The universal-hashing approach
7.9 Problems
Authenticated Encryption
Computational Number Theory
9.1 The basic groups
9.2 Algorithms
9.3 Cyclic groups and generators
9.4 Squares and non-squares
9.5 Groups of prime order
9.6 Historical Notes
9.7 Exercises and Problems
Number-Theoretic Primitives
10.1 Discrete logarithm related problems
10.2 The choice of group
10.3 The RSA system
10.4 Historical notes
10.5 Exercises and Problems
Asymmetric Encryption
11.1 Asymmetric encryption schemes
11.2 Notions of security
11.3 One encryption query or many?
11.4 Hybrid encryption
11.5 El Gamal scheme and its variants
Digital signatures
12.1 Digital signature schemes
12.2 A notion of security
12.3 RSA based signatures
Authenticated Key Exchange
The Asymptotic Approach
Interactive Proofs and Zero Knowledge
15.1 Introduction
15.2 Interactive functions and the accepting probability
15.3 Proofs of language-membership
15.4 NP proof-systems
15.5 Exercises and Problems
The Birthday Problem
Information-Theoretic Security
0 of .
Results for:
P. 1
Introduction to Modern Cryptography

# Introduction to Modern Cryptography

Ratings: (0)|Views: 4,184|Likes:

### Availability:

See More
See less

03/23/2013

pdf

text

original

Pages 6 to 148 are not shown in this preview.
Page 154 is not shown in this preview.
Pages 160 to 249 are not shown in this preview.
Pages 255 to 265 are not shown in this preview.
Pages 271 to 283 are not shown in this preview.

## Activity (6)

### Showing

AllMost RecentReviewsAll NotesLikes