The course consists of two parts:
We start with an historical overview of cryptography en then we look at
the mathematical background of modern cryptographical ciphers.
such as Public Key Cryptography, RSA, Diffie Hellman Protocol and Braid Group Cryptography.
The students also have to crack 4 historical codes.
2. Error correcting codes.
We introduce the notion of an error correcting code and study important examples
such as Hamilton codes, Reed Solomon codes and BCH codes. We also look at efficient encoding and decoding algorithms.