Digression to use modular arithmetic; cryptanalysis

• Caesar cipher:

plaintext a b c d e ….

+ K =

ciphertext d e f g h

K is offset between 0 and 26 => EK (P) = P+K mod 26

Easy attack: try all possible keys.

Moral: cryptosystem insecure if # keys too small.

Previous slide

Next slide

Back to first slide

View graphic version