Introduction to Cryptology

Course guarantor:

Lecturer:

Tutor:

Supervisor:

Department of Mathematics

Synopsis:

An introductive survey of cryptography and cryptoanalysis starting with classical ciphers, passing through mechanical rotor machines, symmetric and asymmetric cryptography to quantum cryptography.

Requirements:

Having the subject Discrete Mathematics done is recommended.

Syllabus of lectures:

1. Classical ciphers (substitution, transposition, Vigenere cipher, Playfair cipher).

2. Mechanical rotor machines (Enigma, Lorenz).

3. Random number generators.

4. Symmetric cryptography (block ciphers, DES, triple DES, AES).

5. Primality testing (Lucas-Lehmer, Rabin-Miller).

6. Asymmetric cryptography (RSA, El Gamal, D-H key exchange, Goldwasser-Micali, Rabin).

7. Digital signature.

8. Hash functions.

9. E-mail and internet secrecy.

10. Quantum cryptography.

Syllabus of tutorials:

Study Objective:

Knowledge:

History of cryptology and actual enciphering techniques and the theory behind them (generation of random numbers, primality testing, hash functions).

Abilities:

Computer implementation of studied algorithms.

Study materials:

Key references:

[1] R. A. Mollin, An Introduction to Cryptography, 2nd edition, Chapman and Hall/CRC, 2007

[2]. J. Katz, Y. Lindell, Introduction to Modern Cryptography, Chapman and Hall/CRC, 2008

Recommended references:

[3] B. Schneier, Applied Cryptography, John Wiley and Sons, 1996

[4] D. Welsh, Codes and Cryptography, Clarendon Press, Oxford, 1989

Note:

Further information:

http://kmlinux.fjfi.cvut.cz/~balkolub/vyuka.html

No time-table has been prepared for this course

The course is a part of the following study plans: