Encryption AlgorithmsHistorical and Toy

Caesar Cipher: {a, b, c … z} {1, 2, 3, … 26}

Enc(X) = Enc(x1 … xN)

= x1 + 3 mod 26 … xN + 3 mod 26 = C1 … CN

E.G. Enc(“Security”) = Enc(19,5,3,21,18,9,20,25)

= 22,8,6,24,21,12,23,2 = “Vhfxulyb”

Previous slide

Next slide

Back to first slide

View graphic version