## Got a YouTube account?

New: enable viewer-created translations and captions on your YouTube channel!

## ← 01-46 Summary

• 1 Follower
• 33 Lines

### Get Embed Code x Embed video Use the following code to embed this video. See our usage guide for more details on embedding. Paste this in your document somewhere (closest to the closing body tag is preferable): ```<script type="text/javascript" src='https://amara.org/embedder-iframe'></script> ``` Paste this inside your HTML body, where you want to include the widget: ```<div class="amara-embed" data-url="http://www.youtube.com/watch?v=4q9KijYd9Xc" data-team="udacity"></div> ``` 1 Language

Showing Revision 1 created 04/24/2012 by Amara Bot.

1. [Evans] So we've reached the end of Unit 1.
2. Let me remind you what we've covered.
3. We covered symmetric cryptosystems and introduced the terminology
4. and definitions we need to talk about encryption.
5. In particular, we know what it means for a cryptosystem to be correct--
6. that encryption and decryption are indeed inverses.
7. Defining security is a much trickier thing, and we talked about ways we could define security
8. for a symmetric cryptosystem.
9. We introduced the one-time pad, which is a very simple but important cryptosystem,
10. and it's all based on using the XOR operation.
11. As long as we have a perfectly random key that's as long as the message,
12. the one-time pad gives us perfect security.
13. We looked at a formal way to define what a perfect cipher means
14. and prove that the one-time pad has that property.
15. We also saw that in order to be perfect, a cipher has to be impractical--
16. that the number of keys has to exceed the number of messages,
17. and that means that every cipher that's used in practice is potentially breakable.
18. We saw one very interesting example of that with how the Allies at Bletchley Park
19. were able to break the Lorenz cipher.
20. We talked about modern symmetric ciphers which take advantage of computing power,
21. following many of the same principles of the historical mechanical ciphers like Lorenz
22. but using modern computing power and new ideas about how to scramble data
23. to produce much more confusion and make things much more challenging for cryptanalysis
24. even when attackers have access to the huge amounts of computing power
25. available today.
26. I hope you enjoyed Unit 1 and have a good understanding
27. of some of the theory behind symmetric ciphers and how they're constructed.
28. In Unit 2 we'll look at how to actually use symmetric ciphers
29. to solve problems like sending a message securely between 2 parties
30. over an insecure channel like the Internet
31. and being able to use symmetric ciphers to play games online
32. and to do important things like managing passwords.
33. Hope to see everyone back for Unit 2.