Cryptography I
Stanford University
Об этом курсе
Cryptography is an indispensable tool for protecting information in computer systems. In this course you will learn the inner workings of cryptographic systems and how to correctly use them in 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 parties generate a shared secret key. Throughout the course participants will be exposed to many exciting open problems in the field and work on fun (optional) programming projects. In a second course (Crypto II) we will cover more advanced cryptographic tasks such as zero-knowledge, privacy mechanisms, and other forms of encryption.
Приобретаемые навыки
CryptographyPython ProgrammingAlgebraInformation Security
Syllabus - What you will learn from this course
1
Section
Course overview and stream ciphers
Week 1. This week's topic is an overview of what cryptography is about as well as our first example ciphers. You will learn about pseudo-randomness and how to use it for encryption. We will also look at a few basic definitions of secure encryption.
12 videos (Total 210 min), 2 readings, 2 quizzes
12 videos
What is Cryptography?15m
History of Cryptography18m
Discrete Probability (Crash Course)18m
Discrete Probability (Crash Course, Cont.)13m
Information Theoretic Security and The One Time Pad18m
Stream Ciphers and Pseudo Random Generators19m
Attacks on Stream Ciphers and The One Time Pad23m
Real-World Stream Ciphers19m
PRG Security Definitions24m
Semantic Security15m
Stream Ciphers are Semantically Secure [optional]10m
2 readings
Lecture slides for all six weeks10m
Course overview and additional reading resources10m
2 practice exercises
Week 1 - Problem Set20m
Week 1 - Programming Assignment [optional]2m
2
Section
Block Ciphers
Week 2. We introduce a new primitive called a block cipher that will let us build more powerful forms of encryption. We will look at a few classic block-cipher constructions (AES and 3DES) and see how to use them for encryption. Block ciphers are the work horse of cryptography and have many applications. Next week we will see how to use block ciphers to provide data integrity. The optional programming assignment this week asks students to build an encryption/decryption system using AES.
11 videos (Total 167 min), 2 quizzes
11 videos
The Data Encryption Standard21m
Exhaustive Search Attacks19m
More Attacks on Block Ciphers 16m
The AES Block Cipher13m
Block Ciphers From PRGs11m
Review: PRPs and PRFs11m
Modes of Operation: One Time Key7m
Security for Many-Time Key (CPA security)22m
Modes of Operation: Many Time Key (CBC)16m
Modes of Operation: Many Time Key (CTR) 9m
2 practice exercises
Week 2 - Problem Set18m
Week 2 - Programming Assignment [Optional]8m
3
Section
Message Integrity
Week 3. This week's topic is data integrity. We will discuss a number of classic constructions for MAC systems that are used to ensure data integrity. For now we only discuss how to prevent modification of non-secret data. Next week we will come back to encryption and show how to provide both confidentiality and integrity. This week's programming project shows how to authenticate large video files. Even if you don't do the project, please read the project description --- it teaches an important concept called a hash chain.
11 videos (Total 130 min), 2 quizzes
11 videos
MACs Based On PRFs9m
CBC-MAC and NMAC19m
MAC Padding8m
PMAC and the Carter-Wegman MAC15m
Introduction 10m
Generic Birthday Attack14m
The Merkle-Damgard Paradigm 11m
Constructing Compression Functions8m
HMAC7m
Timing attacks on MAC verification8m
2 practice exercises
Week 3 - Problem Set20m
Week 3 - Programming Assignment [Optional]2m
4
Section
Authenticated Encryption
Week 4. This week's topic is authenticated encryption: encryption methods that ensure both confidentiality and integrity. We will also discuss a few odds and ends such as how to search on encrypted data. This is our last week studying symmetric encryption. Next week we start with key management and public-key cryptography. As usual there is also an extra credit programming project. This week's project involves a bit of networking to experiment with a chosen ciphertext attack on a toy web site.
12 videos (Total 167 min), 2 quizzes
12 videos
Definitions 5m
Chosen Ciphertext Attacks12m
Constructions From Ciphers and MACs20m
Case Study: TLS 1.217m
CBC Padding Attacks14m
Attacking Non-Atomic Decryption 9m
Key Derivation13m
Deterministic Encryption14m
Deterministic Encryption: SIV and Wide PRP20m
Tweakable Encryption14m
Format Preserving Encryption12m
2 practice exercises
Week 4 - Problem Set20m
Week 4 - Programming Project [Optional]2m
5
Section
Basic Key Exchange
Week 5. This week's topic is basic key exchange: how to setup a secret key between two parties. For now we only consider protocols secure against eavesdropping. This question motivates the main concepts of public key cryptography, but before we build public-key systems we need to take a brief detour and cover a few basic concepts from computational number theory. We will start with algorithms dating back to antiquity (Euclid) and work our way up to Fermat, Euler, and Legendre. We will also mention in passing a few useful concepts from 20th century math. Next week we will put our hard work from this week to good use and construct several public key encryption systems.
9 videos (Total 133 min), 1 reading, 2 quizzes
9 videos
Merkle Puzzles11m
The Diffie-Hellman Protocol19m
Public-Key Encryption10m
Notation14m
Fermat and Euler18m
Modular e'th Roots17m
Arithmetic algorithms12m
Intractable Problems18m
1 readings
More background on number theory10m
2 practice exercises
Week 5 - Problem Set30m
Week 5 - Programming Assignment [Optional]2m
6
Section
Public-Key Encryption
Week 6. This week's topic is public key encryption: how to encrypt using a public key and decrypt using a secret key. Public key encryption is used for key management in encrypted file systems, in encrypted messaging systems, and for many other tasks. The videos cover two families of public key encryption systems: one based on trapdoor functions (RSA in particular) and the other based on the Diffie-Hellman protocol. We construct systems that are secure against tampering, also known as chosen ciphertext security (CCA security). There has been a ton of research on CCA security over the past decade and given the allotted time we can only summarize the main results from the last few years. The lectures contain suggestions for further readings for those interested in learning more about CCA secure public-key systems. The problem set this week involves a bit more math than usual, but should expand your understanding of public-key encryption. Please don't be shy about posting questions in the forum. This is the last week of this Crypto I course. I hope everyone learned a lot and enjoyed the material. Crypto is a beautiful topic with lots of open problems and room for further research. I look forward to seeing you in Crypto II where we will cover additional core topics and a few more advanced topics.
11 videos (Total 155 min), 2 quizzes
11 videos
Constructions10m
The RSA Trapdoor Permutation17m
PKCS 121m
Is RSA a One-Way Function?16m
RSA in Practice13m
The ElGamal Public-key System19m
ElGamal Security13m
ElGamal Variants With Better Security10m
A Unifying Theme11m
Farewell (For Now)5m
2 practice exercises
Week 6 - Problem Set22m
Week 6 - Programming Assignment [Optional]8m
7
Section
Final exam
Congratulations! We are at the end of the course. This module contains only the final exam which covers the entire course. I hope everyone learned a lot during these 6 weeks. Good luck on the final exam and I look forward to seeing you at a future course!
1 quiz
1 practice exercises
Final Exam26m
4.8
26%
83%
Top Reviews
By LG•Dec 16th 2017
This course gives is perfect to start learning cryptography, explanations are detailed, topics carefully selected combining theory with real world examples and making emphasis in important details.
By BC•Mar 11th 2017
Cutting edge cryptography topics. Good explanations and slides, but pause button is highly recommended. Can be a bit too mathematical for the general public, and not very formal for mathematicians.
Instructor
Dan Boneh
ProfessorAbout Stanford University
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
Frequently Asked Questions
When will I have access to the lectures and assignments?
Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.
What will I get if I pay for this course?
If you pay for this course, you will have access to all of the features and content you need to earn a Course Certificate. If you complete the course successfully, your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. Note that the Course Certificate does not represent official academic credit from the partner institution offering the course.
What is the refund policy?
Is financial aid available?
Yes! Coursera provides financial aid to learners who would like to complete a course but cannot afford the course fee. To apply for aid, select "Learn more and apply" in the Financial Aid section below the "Enroll" button. You'll be prompted to complete a simple application; no other paperwork is required.
More questions? Visit the Learner Help Center
Coursera делает лучшее в мире образование доступным каждому, предлагая онлайн-курсы от ведущих университетов и организаций.
© Coursera Inc., 2018 Все права защищены.
