v Subject matter

Ø Introduction and Conventional Encryption

§ Types of attacks

§ Old-time ciphers – attacks and weaknesses, not details

§ Modern block ciphers

· Reversibility – Feistel structure or reversible primitives

· DES

· Basic understanding of AES

· Performance and strength comparisons

§ Confidentiality

· Random number generation

· Key distribution

Ø Public Key Cryptography

§ The RSA algorithm

§ Diffie-Hellman key exchange

§ Elliptic curves over Z(p) – not over Galois fields

Ø Number Theory

§ Modulo arithmetic

§ Fermat’s and Euler’s theorems

§ Euclid’s algorithm and its extension

§ Exponentiation and Chinese remainder

§ Primality and primality testing

v Coverage

Ø See exam policies

Ø Through chapter 10 – not including appendices 3A and 6A

Ø No Bent functions or Chinese remainder calculations

v Exam methodology

Ø Open book and notes (avoids memorization)

Ø Mostly short-answer

§ What if

§ Why

§ Invent a way to do---

Ø Learn capabilities, not forgettable details

Ø Emphasis is more on protocols and algorithm consequences than on ciphers themselves