LFU:online

Students who have completed this module should understand the topics covered in the lecture, and be able to express and apply them. They know the notations of information theory and cryptology and can solve problems of information theory and cryptology by algorithms.

Randomized algorithms; pseudo-random generators; entropy of information sources; redundancy of natural languages; lossless data compression; symmetric cryptosystems; secret sharing; public-key cryptosystems; digital signatures and cryptographic hash functions.

Continuous assessment (based on regular written and/or oral contribution by participants).

Course examination according to § 7, statute section on "study-law regulations"

Will be discussed in the first lesson.