Description
This course introduces the techniques (both science and art!) in the design, security analysis, and cryptanalysis of symmetric cryptography primitives.
We will examine several primitives including stream ciphers, block ciphers, and collision-resistant hash functions, which we will apply in order to design protocols for symmetric-key encryption and message authentication codes. Additionally, we will analyze the mathematical strength of these primitives toward common types of mathematical cryptanalysis. Finally, we will explore provably-secure constructions of symmetric-key encryption schemes and message authentication codes from these building blocks.
The course will have a hands-on approach, including a symmetric cipher competition of our own.
The most important prerequisite is familiarity with algebra and probability. Prior exposure to cryptography is helpful but not required.
We will examine several primitives including stream ciphers, block ciphers, and collision-resistant hash functions, which we will apply in order to design protocols for symmetric-key encryption and message authentication codes. Additionally, we will analyze the mathematical strength of these primitives toward common types of mathematical cryptanalysis. Finally, we will explore provably-secure constructions of symmetric-key encryption schemes and message authentication codes from these building blocks.
The course will have a hands-on approach, including a symmetric cipher competition of our own.
The most important prerequisite is familiarity with algebra and probability. Prior exposure to cryptography is helpful but not required.
General Information
Lecture time and location
2:30-4pm on Tuesdays and Thursdays in PSY B53
BU Learn website (for problem set submissions)
| Name | Office Hours | |
|---|---|---|
Mayank Varia | When? Where? |