M8830p Number Theoretic Algorithms - lecture

Faculty of Science
Spring 2000
Extent and Intensity
2/0/0. Type of Completion: zk (examination).
Teacher(s)
prof. RNDr. Radan Kučera, DSc. (lecturer)
Guaranteed by
prof. RNDr. Radan Kučera, DSc.
Department of Mathematics and Statistics – Departments – Faculty of Science
Contact Person: prof. RNDr. Radan Kučera, DSc.
Course Enrolment Limitations
The course is only offered to the students of the study fields the course is directly associated with.
Syllabus
  • (1) Compositeness tests: Fermat test, Carmichael numbers, Rabin-Miller test (2) Primality tests: the Poclington-Lehmer n-1 test, the elliptic curve test (3) Factoring: Lehmann's method, Pollard's $\rho$ method, Pollard's p-1 method, the continued fraction method, the elliptic curve method, the quadratic sieve method
Literature
  • COHEN, Henri. A Course in Computational Algebraic Number Theory. Springer-Verlag, 1993, 534 pp. Graduate Texts in Mathematics 138. ISBN 3-540-55640-0. info
Language of instruction
Czech
Further Comments
The course is taught once in two years.
The course is taught: every week.
Teacher's information
ftp://www.math.muni.cz/pub/math/people/Kucera/lectures/atc.ps
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/sci/spring2000/M8830p