Course content

The contents of the course may vary, but will be about provable security in cryptography. Common topics include relations among computational problems, security definitions for common cryptoprimitives and relations among them, security proofs for common constructions, multiparty computations and algorithms for breaking cryptosystems, e.g. number field sieve.

Learning outcome

1. Knowledge. The contents of the course may vary, but will be about provably security in cryptography. Usually included is knowledge about important computational problems in cryptography and relations among them, security proofs for common constructions in cryptography, multiparty computations and algorithms for breaking cryptosystems, e.g. the number field sieve. 2. Skills. The students will learn about security proofs in cryptography, search relevant literature and will be able to conduct research in cryptography. 3. Competence. The students will be able to participate in scientific discussions, present results, discuss cryptographically relevant ethical problems and begin with research in cryptography.

Learning methods and activities

The course begins with introductory lectures, and thereafter student presentations.

The course will be taught as needed.

Recommended previous knowledge

TMA4160 Cryptography or similar.

Course materials

Will be announced at the start of the course.