Pseudo Random Permutations (PRP)

Stream ciphers

Advanced Encryption Standard (AES)

Cipher Block Chaining (CBC)

Merkle-Damgard construction

Active attacks

Discrete logarithm assumption

Identification protocols

SecurID

Digital signature

Post-quantum digital signatures

End-to-end encryption

Symmetric-key encryption

Block cipher

Chosen Plaintext Attacks (CPA)

PMAC

Hash-based Message Authentication Code (HMAC)

Trapdoor function

Certificate Transparency

One-time passwords

Secure Socket Layer (SSL)

Shor's algorithm

Diffie-Hellman key exchange

Semantic security

Pseudo Random Functions (PRF)

CBC-MAC

Secure Hash Algorithm (SHA)

Finite cyclic groups

Chosen Ciphertext Attacks (CCA) security

Certificates

Salts

Authenticated key exchange

Grover's algorithm

Cipher

One time pad

Iterated Even-Mansour ciphers

Counter mode

Collision-resistant hashing

Authenticated encryption

Computational Diffie-Hellman (CDH) assumption

RSA trapdoor permutation

Certificate revocation

S/Key

Transport Layer Security (TLS)

Post-quantum cryptography

Perfect secrecy

Message integrity

Davies-Meyer construction

Arithmetic modulo primes

ElGamal public key encryption

Hash-based signatures

Password protocols

Challenge-response authentication

Zero-knowledge proof

Post-quantum key exchange

CS 255: Introduction to Cryptography Stanford University Winter 2023 This course offers an introduction to cryptographic techniques used in computer security, covering encryption, message integrity, digital signatures, key management, and more. It is suitable for advanced undergraduates and masters students with some proof techniques and programming experience. Cryptography is an indispensable tool for protecting information in computer systems. This course explains the inner workings of cryptographic primitives and how to use them correctly.

This course is an introduction to the basic theory and practice of cryptographic techniques used in computer security. We will cover topics such as encryption (secret-key and public-key), message integrity, digital signatures, user authentication, key management, cryptographic hashing, Network security protocols (SSL, IPsec), public-key infrastructure, digital rights management, and a bit of zero-knowledge protocols.

Optional readings can be found in the textbooks denoted by KL and AC in the syllabus below. The optional AC book, by Boneh and Shoup, is more advanced (and free) and is intended for students wishing to go deeper. The [online version of the course](https://crypto.stanford.edu/~dabo/courses/OnlineCrypto/) is another resource for the material covered in class.

- **Boneh-Shoup (AC):** (free) *[A Graduate Course in Applied Cryptography](https://cryptobook.us) (V 0.5)* by D. Boneh and V. Shoup
- **KL:** *[Introduction to Modern Cryptography](http://www.cs.umd.edu/~jkatz/imc.html)* (2nd edition) by J. Katz and Y. Lindell.  The course is self contained, however a basic understanding of probability theory and modular arithmetic will be helpful. The course is intended for advanced undergraduates and masters students. Students are expected to have experience with basic proof techniques and some programming experience. Students can supplement the lectures with an [online version of the course](https://www.coursera.org/learn/crypto) (MOOC) that covers some of the material.

The following books can be used to supplement the lectures:

- Optional: *[A Graduate Course in Applied Cryptography](https://cryptobook.us)* by D. Boneh and V. Shoup. (free)
- Optional: *[Introduction to Modern Cryptography](http://www.cs.umd.edu/~jkatz/imc.html)* by J. Katz and Y. Lindell.

Note that the textbooks do not cover all the material discussed in class.

CS 255: Introduction to Cryptography

Computer Security and Cryptography

Pseudorandom permutation

Pseudo Random Permutations (PRP)

1 courses cover this concept

CS 255: Introduction to Cryptography