Once you have finished the course, you have a good understanding of mathematical methods in symmetric and asymmetric cryptography and cryptanalysis. You are able to apply linear and differential cryptanalysis on block ciphers and evaluate cryptographic properties of Boolean functions and linear complexity sequences. You are familiar with efficient algorithms for setting up an instance of cryptosystem with public keys based on the integer factorization problem or the discrete logarithm problem in a finite field or on an elliptic curve. You also know about the complexity of breaking such cryptosystems.
Mathematical properties of modern cryptographic methods. Information theory of secrecy systems. Linear complexity. Differential and linear cryptanalysis. Algorithms for Boolean functions. Cryptanalysis algorithms for factoring and the discrete logarithm. Elliptic curve cryptography.
D. R. Stinson: Cryptography: Theory and Practice, third ed., CRC Press, 2005.
The students have two options to pass the course, either by taking two mid term exams Feb 19 and April 8, or one final exam May 27. For more details, see the events calendar.