
CryptologySubject of the group A for: InformaticsTerm: winter Extent: 31 Year: 1st graduate study Lecturer: prof. RNDr. Otokar Grošek, CSc. Proportion of final exams in the course completion: 60%. Keywords: cryptology, block ciphers, publickey cryptography. Annotation: A content of this course interlace topics from different areas of mathematics and computer science. A good skill in modular arithmetic and preliminary knowledge from group theory, and computer complexity theory is welcome but not required. The aim of this course is to give an overview to block and publickey cryptography. Syllabus in twelve points:
Target: The aim of this course is to give an overview of basic theoretical as well as practical approach to solve problems in cryptography. The first part is devoted to classical ciphers and their solution. The second part is an introduction to some algebraic techniques which allows to design so called block ciphers, as DES, IDEA and RIJNDAEL In the last part, several publickey cryptography techniques are introduced. Recommended prerequisites: Content of this course interlace topics from different areas of mathematics and computer science. Prerequisites for the course are the following courses: Linear algebra, Probability theory and statistics, Coding theory, Computational complexity. A overview of necessary knowledge of modular arithmetic, group theory, and computer complexity theory is given at the beginning of the course is included.
Bibliography:
