Tags
Language
Tags
March 2024
Su Mo Tu We Th Fr Sa
25 26 27 28 29 1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30
31 1 2 3 4 5 6

Stanford University - Cryptography (Coursera, 2012)

Posted By: alexov85
Stanford University - Cryptography (Coursera, 2012)

Stanford University - Cryptography (Coursera, 2012)
eLearning (Video+PDF slides) | English | 960x540 | H264 ~72 kbps | AAC ~1411 Kbps | 1.03 GB
Cryptography

Cryptography is an indispensable tool for protecting information in computer systems. This course explains the inner workings of cryptographic primitives and how to correctly use them. Students will learn how to reason about the security of cryptographic constructions and how to apply this knowledge to real-world applications. The course begins with a detailed discussion of how two parties who have a shared secret key can communicate securely when a powerful adversary eavesdrops and tampers with traffic. We will examine many deployed protocols and analyze mistakes in existing systems. The second half of the course discusses public-key techniques that let two or more parties generate a shared secret key. We will cover the relevant number theory and discuss public-key encryption, digital signatures, and authentication protocols. Towards the end of the course we will cover more advanced topics such as zero-knowledge, distributed protocols such as secure auctions, and a number of privacy mechanisms. Throughout the course students will be exposed to many exciting open problems in the field.
The course will include written homeworks and programming labs. The course is self-contained, however it will be helpful to have a basic understanding of discrete probability theory.

Courses list:

Introduction (week 1)

Course Overview (11 min)
What is cryptography? (15 min)
History of cryptography (19 min)
Discrete probability (16 min)

Stream Ciphers (week 1)

Information theoretic security and the one time pad (19 min)
Stream ciphers and pseudo random generators (20 min)
Attacks on stream ciphers and the one time pad (24 min)
Real-world stream ciphers (20 min)
PRG Security Definitions (25 min)
Semantic Security (16 min)
Stream ciphers are semantically secure (11 min)

Block Ciphers (week 2)

What are block ciphers? (17 min)
The Data Encryption Standard (22 min)
Exhaustive search attacks (20 min)
More attacks on block ciphers (16 min)
The AES block cipher (14 min)
Block ciphers from PRGs(12 min)

Using Block Ciphers (week 2)

Review: PRPs and PRFs (12 min)
Modes of operation: one time key (8 min)
Security for many-time key (23 min)
Modes of operation: many time key (CBC) (16 min)
Modes of operation: many time key (CTR) (10 min)

Message Integrity (week 3)

Message Authentication Codes (16 min)
MACs Based On PRFs (10 min)
CBC-MAC and NMAC (20 min)
MAC padding (9 min)
PMAC and the Carter-Wegman MAC (16 min)

Collision Resistance (week 3)

Introduction (11 min)
Generic birthday attack (16 min)
The Merkle-Damgard Paradigm (12 min)
Constructing compression functions (8 min)
HMAC (7 min)
Timing attacks on MAC verification (9 min)

Authenticated Encryption (week 4)

Active attacks on CPA-secure encryption (13 min)
Definitions (6 min)
Chosen ciphertext attacks (12 min)
Constructions from ciphers and MACs (21 min)
Case study: TLS (18 min)
CBC padding attacks (14 min)
Attacking non-atomic decryption (10 min)

Odds and ends (week 4)

Key Derivation (14 min)
Deterministic Encryption (15 min)
Deterministic Encryption:SIV and wide PRP (21 min)
Tweakable encryption (15 min)
Format preserving encryption (13 min)

Basic key exchange (week 5)

Trusted 3rd parties (11 min)
Merkle Puzzles (11 min)
The Diffie-Hellman protocol (19 min)
Public-key encryption (11 min)

Intro. Number Theory (week 5)

Notation (15 min)
Fermat and Euler (18 min)
Modular e'th roots (17 min)
Arithmetic algorithms (13 min)
Intractable problems (19 min)

Public Key Encryption from trapdoor permutations (week 6)

Definitions and security (16 min)
Constructions (11 min)
The RSA trapdoor permutation (18 min)
PKCS 1 (23 min)
Is RSA a one-way function? (17 min)
RSA in practice (14 min)

Public key encryption from Diffie-Hellman (week 6)

The ElGamal Public-key System (23 min)
ElGamal Security (14 min)
ElGamal Variants With Better Security (11 min)
A Unifying Theme (12 min)
Farewell (for now) (6 min)

Author: Dan Boneh, Professor

Total Run time: ~15 hours

Stanford University - Cryptography (Coursera, 2012)

Stanford University - Cryptography (Coursera, 2012)

Stanford University - Cryptography (Coursera, 2012)

Stanford University - Cryptography (Coursera, 2012)