Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Numerical Algorithms - NMMX402

Title:	Číselné algoritmy
Guaranteed by:	Student Affairs Department (32-STUD)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2022
Semester:	summer
E-Credits:	5
Hours per week, examination:	summer s.:2/1, C+Ex [HT]
Capacity:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	taught
Language:	English
Teaching methods:	full-time
Is provided by:	NMMB402

Guarantor:	doc. Mgr. Pavel Příhoda, Ph.D.
Class:	M Mgr. MMIB M Mgr. MMIB > Povinně volitelné
Classification:	Mathematics > Algebra
Incompatibility :	NMIB014, NMMB402
Interchangeability :	NMIB014, NMMB402

Opinion survey results Examination dates SS schedule Noticeboard

Annotation -

The course is an introduction to methods for integer factorization, in particular, factoring algorithms with subexponential time complexity are presented. The student gets enough details for basic implementation of these algorithms.

Last update: Kaplický Petr, doc. Mgr., Ph.D. (07.01.2019)

Course completion requirements -

Homeworks and oral exam.

Last update: Příhoda Pavel, doc. Mgr., Ph.D. (29.10.2019)

Literature -

Cohen: A course in computational algebraic number theory, Springer-Verlag 1993.

Last update: T_KA (14.05.2013)

Requirements to the exam -

The exam consists of 3 questions. Two of them are on algorithms and theoretical background one question has computational character.

Last update: Příhoda Pavel, doc. Mgr., Ph.D. (21.02.2024)

Syllabus -

Simple algorithms for factorization of integers. Subexponential algorithms, CFRAC and Quadratic Sieve. Lenstra's method based on arithmetics of elliptic curves. Connection between factorization problem for integers and the discrete logarithm problem.

Last update: Kaplický Petr, doc. Mgr., Ph.D. (07.01.2019)