Course Overview

In this course lecturewe will discuss the theory of elliptic curves
and how to use them incryptography.

Learning Achievement

Competence

Course prerequisites

> Applicants should:

- Have completed, with good results, a Bachelor of science degree in
Mathematics or equivalent.
- Have thorough proficiency in written and spoken English.

Grading Philosophy

Exams take place in December.

Course schedule

> The course will be organized as follows:

-  In the first part wedescribe the group structure of an elliptic
curve defined over a finite fieldand how to derive cryptographic
applications from the corresponding discretelogarithm problem.
- In the second part we introduce pairings on ellipticcurves and
explain how to construct more powerful cryptographic tools withthem.

> The lectures will be illustrated by programming sessions using
Pari/GP.

> Bibliography:

- Steven Galbraith, Mathematics ofPublic Key Cryptography, Cambridge
University Press (2012), in particular PartsII and V.

- Andreas Enge, Elliptic curves and their applications to
cryptography (an introduction), Springer, 1999.

Course type

> Lectures and programming sessions: - 48 course hours. - 120 hours of personal study.

Online Course Requirement

Instructor

Other information

- This course is part of the ALGANT Joint Master Program.

- For further information on the program structure, partner
institutions, scholarship opportunities, etc., please visit: ALGANT
Erasmus Mundus. [http://algant.eu/]

Duration: Fall Semester

Language of instruction: English
Mode of delivery: Face-to-face teaching

Site for Inquiry