v Subject matter

Ø Introduction and Conventional Encryption

§ Types of attacks

§ Old-time ciphers

§ Modern block ciphers

· DES

· Other algorithms – Blowfish, Idea, etc.

· Reversibility – Feistel structure or reversible primitives

· Performance and strength comparisons

§ Confidentiality

· Random number generation

· Key distribution

Ø Public Key Cryptography

§ The RSA algorithm

§ Diffie-Hellman key exchange

Ø Number Theory

§ Modulo arithmetic

§ Fermat’s and Euler’s theorems

§ Euclid’s algorithm and its extension

§ Exponentiation and Chinese remainder

§ Primality and primality testing

Ø Message Authentication

§ Authentication requirements

§ Hash functions without keys

§ MAC functions with secret keys

§ Embedded algorithms (those with pre- and post encryption

§ The signature problem – what is guaranteed by a signature

v Coverage

Ø See exam policies

Ø Through Tuesday, February 12

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

Ø No Bent functions, elliptic curves, 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