|
|
|
||
Last update: doc. Mgr. Petr Kaplický, Ph.D. (07.01.2019)
|
|
||
Last update: doc. Mgr. Pavel Příhoda, Ph.D. (29.10.2019)
Homeworks and oral exam. |
|
||
Last update: T_KA (14.05.2013)
Cohen: A course in computational algebraic number theory, Springer-Verlag 1993. |
|
||
Last update: doc. Mgr. Pavel Příhoda, Ph.D. (21.02.2024)
The exam consists of 3 questions. Two of them are on algorithms and theoretical background one question has computational character.
|
|
||
Last update: doc. Mgr. Petr Kaplický, Ph.D. (07.01.2019)
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. |