Course content

A brief overview of symmetric key cryptography. Diffie-Hellman, public-key encryption (ElGamal, RSA, lattice-based), digital signatures (RSA, Schnorr). Security definitions for cryptographic schemes. Algorithms from algebra and number theory, including primality testing, computation of discrete logarithms in cyclic groups, and elliptic curves over finite fields. The exact contents may vary from year to year, and may including more advanced topics.

Learning outcome

1. Knowledge. The student has an overview of the algebra that forms the basis of modern symmetric and asymmetric cryptography, and some knowledge of classical and modern symmetric cryptography. The student is familiar with the theory of finite cyclic groups, finite fields, elliptic curves and lattices. Moreover, the student is familiar with the motivation for, the use of and attacks on asymmetric cryptography, and knows the main systems and security definitions.

2. Skills. The student masters cryptographic algorithms, including algorithms for key generation, encryption, decryption and cryptanalysis. The student has acquired some intuition about how to attack cryptosystems.

Learning methods and activities

Lectures and exercises. The exercises may involve the use of computers. Students are free to choose Norwegian or English for written assessments.

Recommended previous knowledge

The course is based on TMA4150 Algebra or similar background from algebra, or MA2201 Algebra (see course description for 2014/15). Some proficiency in the use of computers.

Course materials

Will be announced at the start of the course.

Credit reductions