FI:M024 Cryptography - Course Information

M024 Cryptography

Faculty of Informatics
Autumn 1997

Extent and Intensity

2/1. 3 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).

Teacher(s)

prof. RNDr. Jan Paseka, CSc. (lecturer)

Guaranteed by

Contact Person: prof. RNDr. Jan Paseka, CSc.

Prerequisites

M003 Linear Algebra I
Before enrolling this course the students should go through M003 Linear Algebra and Geometry I, M011 Statistics I,M008 Algebra I and I012 Complexity.

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

Syllabus

Introduction. A very abstract summary. History. Outline of the course.
Cryptosystems and their application in computer science. Basic principles. Breaking a cryptosystem. Perfect secrecy.
The one time-pad and linear shift-register sequences. The one time-pad. The insecurity of linear shift register sequences.
One-way functions. Informal approach; the password problem. Using NP-hard problems as cryptosystems. The Data Encryption Standard (DES). The discrete logarithm.
Public key cryptosystems. The idea of a trapdoor function. The Rivest-Shamir-Adleman (RSA) system. A public-key system based on the discrete logarithm.
Authentication and digital signatures. Authentication in a communication system. Using public key networks to send signed messages. Two-party protocols. Multi-party protocols.
Randomized encryption.

Language of instruction

Czech

The course is also listed under the following terms Spring 1996, Autumn 1999, Spring 2002.