Generalizations of Caesar Cipher(all weak security)

Shift: Enck(x) = x+k mod 26

Affine: Enck1,k2(x) = k1 *x + k2 mod 26

Substitution: Encperm(x) = perm(x)

Previous slide

Next slide

Back to first slide

View graphic version