Software Images icon An illustration of two photographs. Images Donate icon An illustration of a heart shape Donate Ellipses icon An illustration of text ellipses. Coursera Cryptography 1 Movies Preview. It appears your browser does not have it turned on. Please see your browser settings for this feature. This week's project involves a bit of networking to experiment with a chosen ciphertext attack on a toy web site.
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.
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.
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! Provides a comprehensive introduction to cryptographic history, current technology, best practices and known attacker techniques.
A great deal of material is covered in a relatively compact program. 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. 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.
Really interesting, provides the basic grounds for understanding a lot of discussions out there. Wikipedia can be useful as a reference, but here I was able to learn about semantic security etc. Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free.
To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit.
If you don't see the audit option:. When you purchase a Certificate you get access to all course materials, including graded assignments. Upon completing the course, your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free. Yes, Coursera provides financial aid to learners who cannot afford the fee.
This is a source code for optional programming assignments of Cryptography I class on Coursera. Even though assignments are optional, this code being publicly available might still be a violation of Honor Code. Thus, I have two requests:. Let us see what goes wrong when a stream cipher key is used more than once.
Below are eleven hex-encoded ciphertexts that are the result of encrypting eleven plaintexts with a stream cipher, all with the same stream cipher key. Your goal is to decrypt the last ciphertext, and submit the secret message within it as solution. In both cases the byte encryption IV is chosen at random and is prepended to the ciphertext. Suppose a web site hosts large video file F that anyone can download.
Browsers who download the file need to make sure the file is authentic before displaying the content to the user. Browsers would download the entire file F , check that H F is equal to the authentic hash value h and if so, display the video to the user.
Unfortunately, this means that the video will only begin playing after the entire file F has been downloaded. Week 5 : Basic key exchange chapter 10 in the textbook. Basic key exchange: pdf pptx Crash course in number theory: pdf pptx.
Week 6 : Public-key encryption chapters in the textbook. Trapdoor permutation: pdf pptx Diffie-Hellman: pdf pptx. Week 7 : Digital signatures chapters in the textbook.
0コメント