Cryptography
Cryptography is an indispensable tool for protecting information in computer systems.Take This Course Free
Take This Course Free
by Stanford University
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 and basic key-exchange. Throughout the course students will be exposed to many exciting open problems in the field.
Source: Stanford University
MODULE 1: Introduction (Week 1)
-
Document Lesson 1:
Course Overview
-
Document Lesson 2:
What is Cryptography ?
-
Document Lesson 3:
History of Cryptography
-
Document Lesson 4:
Discrete probability (Crash Course)
-
Document Lesson 5:
Discrete probability (Crash Course, cont)
MODULE 2: Stream Ciphers (Week 1)
-
Document Lesson 1:
Information theoretic security and one ttime pad
-
Document Lesson 2:
Stream ciphers and pseudo random generators
-
Document Lesson 3:
Attacks on stream ciphers and the one time pad
-
Document Lesson 4:
Real Stream Ciphers
-
Document Lesson 5:
PRG Security Definitions
-
Document Lesson 6:
Semantic Security
-
Document Lesson 7:
Stream Ciphers are semantically Secure
MODULE 3: Block Ciphers (Week 2)
-
Document Lesson 1:
What are block ciphers ?
-
Document Lesson 2:
The data encryption standard
-
Document Lesson 3:
Exhaustive search attacks
-
Document Lesson 4:
More attacks on block ciphers
-
Document Lesson 5:
The AES block ciphers
-
Document Lesson 6:
Block ciphers from PRGs
MODULE 4: Using Block Ciphers (Week 2)
-
Document Lesson 1:
Review : PRPs and PRFs
-
Document Lesson 2:
Modes of operation
-
Document Lesson 3:
Security for many time key
-
Document Lesson 4:
Modes of operation:many time key(CBC)
-
Document Lesson 5:
Modes of operation:many time key(CTR)
MODULE 5: Message integrity (Week 3)
-
Document Lesson 1:
Message authentication codes
-
Document Lesson 2:
MACs Based on PRFs
-
Document Lesson 3:
CBC-MAC and NMAC
-
Document Lesson 4:
MAC padding
-
Document Lesson 5:
PMAC and and Carter-Wegmen MAC
MODULE 6: Collision Resistance (Week 3)
-
Document Lesson 1:
Introduction
-
Document Lesson 2:
Generic birthday attack
-
Document Lesson 3:
The Merkle-Damgard Paradigm
-
Document Lesson 4:
Constructing Compression functions
-
Document Lesson 5:
HMAC
-
Document Lesson 6:
Timing attacks on MAC verification
MODULE 7: Authenticated Encryption (Week 4)
-
Document Lesson 1:
Activ attacks on CPA-Secure encryption
-
Document Lesson 2:
Definitions
-
Document Lesson 3:
Chosen ciphertext attacks
-
Document Lesson 4:
Constructions from ciphers and MACs
-
Document Lesson 5:
Case Study:TLS
-
Document Lesson 6:
CBC padding attacks
-
Document Lesson 7:
Attacking non-atomic decryption
MODULE 8: Odds and Ends (Week 4)
-
Document Lesson 1:
Key Derivation
-
Document Lesson 2:
Deterministic Encrytpion
-
Document Lesson 3:
Deterministic Encrytpion: SN and Wide PRP
-
Document Lesson 4:
Tweakable encryption
-
Document Lesson 5:
Format Preserving encryption
MODULE 9: Basic Key Exchange(Week 5)
-
Document Lesson 1:
Trusted 3rd parties
-
Document Lesson 2:
Merkle Puzzles
-
Document Lesson 3:
The Diffie-Hellman protocol
-
Document Lesson 4:
Public Key Encryption
MODULE 10: Intro Number theory(Week 5)
-
Document Lesson 1:
Notation
-
Document Lesson 2:
Fermat and Euler
-
Document Lesson 3:
Modular e'th roots
-
Document Lesson 4:
Arthemetic Algorithms
-
Document Lesson 5:
Intractable problems
MODULE 11: Public key Encryption from trapdoor permutations
-
Document Lesson 1:
Definitions and Security
-
Document Lesson 2:
Constructions
-
Document Lesson 3:
The RSA trapdoor permutation
-
Document Lesson 4:
PKCS 1
-
Document Lesson 5:
Is RSA a one way function ?
-
Document Lesson 6:
RSA in practice
MODULE 12: Public key encryption from Diffie-Hellmen (Week 6)
-
Document Lesson 1:
The ElGamal Public-Key systems
-
Document Lesson 2:
ElGamal security
-
Document Lesson 3:
ElGamal variants with better security
-
Document Lesson 4:
Farewell
View All Users Who Viewed This Course Also Viewed
-
-
Shall We Learn Scratch Programming for Tweens
Scratch Lessons: Shall We Learn Scratch Programming for Tweens
Free -
Stanford University
Other Courses from Stanford University
-
FreeCryptography
Cryptography is an indispensable tool for protecting information in computer systems.
-
FreeiPhone Application Development
Stanford University Lectures for iPhone Application Development
