Material Detail

These are lecture notes for cs427 at Oregon State University, an introductory course in cryptography at the advanced undergraduate level. By reading and studying these notes, you should expect to learn how to:

• State and interpret the standard formal definitions for the most common cryptographic security properties (privacy and authentication).
• Formally prove security properties of sound cryptographic constructions, and break the security of unsound ones.
• Choose the appropriate cryptographic primitive for a task (block ciphers, hash functions, MACs, public-key encryption, etc.) while avoiding common pitfalls.

Along the way, you will also learn how the most common cryptographic constructions work.

You will get the most out of these notes if you have a solid foundation in standard undergraduate computer science material:

• Discrete mathematics [required]: for modular arithmetic, discrete probabilities, simple combinatorics, and especially proof techniques.
• Algorithms & data structures [highly recommended]: for reasoning about computations at an abstract level.
• Theory of computation (automata, formal languages & computability) [recommended]: for even more experience formally reasoning about abstract processes of computation.

This will delete the comment from the database. This operation is not reversible. Are you sure you want to do it?

Thank you for reporting a broken "Go to Material" link in MERLOT to help us maintain a collection of valuable learning materials.

If you feel this material is inappropriate for the MERLOT Collection, please click SEND REPORT, and the MERLOT Team will investigate. Thank you!

You are being taken to the material on another site. This will open a new window.

Do not show me this again