Course detail

Geometrical Algorithms and Cryptography

FSI-SAV-A Acad. year: 2019/2020 Summer semester

Basic outline of computational geometry, commutative algebra and algebraic geometry with the emphasis on convexity, Groebner basis, Buchbereger algorithm and implicitization. Elliptic curves in cryptography, multivariate cryptosystems.

Language of instruction

English

Number of ECTS credits

4

Learning outcomes of the course unit

The algoritmization of some geometric and cryptographic problems.

Prerequisites

Basics of algebra. The craft of algoritmization.

Planned learning activities and teaching methods

The course is taught through lectures explaining the basic principles and theory of the discipline.

Assesment methods and criteria linked to learning outcomes

Exam: oral

Aims

The convergence of mathematician and computer scientist points of view.

Specification of controlled education, way of implementation and compensation for absences

Lectures: recommended

The study programmes with the given course

Type of course unit

 

Lecture

26 hours, optionally

Teacher / Lecturer

Syllabus

1. Convexity in euclidean spaces.
2. Voronoi diagrams.
3. Geodesic spaces.
4. Rings and fields.
5. Ideals and factorizations.
6. Polynomials, the ordering of polynomials.
7. Groebner basis.
8. Polynomial automorphisms.
9. Algebraic varieties, implicitization.
10. Elliptic and hyperelliptic curves.
11. Principles of asymmetric cryptography.
12. Cryptography based on elliptic curves.
13. Multivariate cryptosystems.