Mathematical cryptography.

Mathematical cryptography.

Varnovsky Nickolay. Fall Annual Course.

The first lectures are a primer in cryptography/ Students get knowledge of three tasks of cryptography: privacy, integrity and untraceability, and of main cryptographic concepts: cryptographic protocol, cryptographic primitive, adversary, attack, security etc. Subsequent lectures study private key cryptosystems as an example of cryptographic protocols solving the task of privacy. The task of integrity is illustrated by electronic signature protocols. The course is concluded by two specific topics: a notion of zero-knowledge proof and e-payment protocol. The last provides an example of solving the task of untraceability.

The course of the research group

Theoretical Computer Science

Back to the list of courses of ISP RAS