next up previous
Next: Shannon's approach to secrecy Up: A Whirlwind Tour of Previous: The birth of mathematical

Basics of encryption


Definition. An encryption system consists of:

such that for all k in K, and for all m in M, Dk(Ek(m)) = m

Example Define M and C to be strings of letters from the alphabet Z/nZ, and let K=Z/nZ. Define ek(x) = x+k mod n., and

ek(m1m2...ml) = ( ek(m1),ek(m2),...,ek(ml))

Example (One time pad) In the previous example, take k=(k1,...,kl), and define

Ek(m1 m2 ... ml) = (ek1}(m1), ek2}(m2), ... ekl(ml))



Kevin McCurley
1/23/1998