|
|
|
||
|
Last update: doc. Mgr. et Mgr. Jan Žemlička, Ph.D. (29.04.2019)
|
|
||
|
Last update: doc. Mgr. et Mgr. Jan Žemlička, Ph.D. (28.10.2019)
Oral exam. |
|
||
|
Last update: T_KA (14.05.2013)
H. Cohen: A Course in Computational Algebraic Number Theory, Springer, 2000
The Development of the Number Field Sieve, (eds. A. K. Lenstra and H. W. Lenstra, Jr.) Lecture Notes in Mathematics 1554, Springer, 1993
M. Pohst, H. Zassenhaus: Algorithmic Algebraic Number Theory, Cambridge University Press, 1989 |
|
||
|
Last update: doc. Mgr. Pavel Příhoda, Ph.D. (21.10.2020)
Students have to pass final oral exam. The exam consists of three questions. The first one is a brief outline of the NFS, the second one is on the theoretical background and the third one has computational character.
In distance form the students have to do a homework which is an implemenation of a part of NFS presented during the lecture without technical details. |
|
||
|
Last update: T_KA (14.05.2013)
The aim of the lecture is to expose the mathematical principles of the quadratic sieve and of the number field sieve which are used when factorizing large integers and when solving the discrete logarithm problem. To this purpose the relevant parts of algebraic number theory will be presented. An attention, while in a limited scale, will be paid to implementation aspects as well.
|
|
||
|
Last update: doc. Mgr. Pavel Příhoda, Ph.D. (29.10.2019)
Basic knowledge of commutative algebra at the level of the corresponding undergraduate course. Also the knowledge of factoring algorithms based on Fermat's factorization is assumed. However, everything neccessary is briefly recalled during the course. |