M025 Number Theoretic Algoritmhs

Faculty of Informatics
Spring 2000
Extent and Intensity
2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
Teacher(s)
prof. RNDr. Radan Kučera, DSc. (lecturer)
Guaranteed by
Departments – Faculty of Science
Contact Person: prof. RNDr. Radan Kučera, DSc.
Prerequisites
M003 Linear Algebra and Geometry I && M004 Linear Algebra and Geometry II && M008 Algebra I && M009 Algebra II
Before enrolling this course the students should go through M003 Linear Algebra and Geometry I, M004 Linear Algebra and Geometry II, M008 Algebra I, and M009 Algebra II.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Syllabus
  • Compositeness tests: Fermat test and Carmichael numbers, Rabin--Miller test.
  • Primality tests: Poclington--Lehmer $N-1$ test, elliptic curve method.
  • Factorization: Pollard $rho$ method, Pollard $p-1$ method, continued fraction method, elliptic curve method, 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
http://www.math.muni.cz/ftp/ftp/pub/math/people/Kucera/lectures/
The course is also listed under the following terms Spring 1996, Spring 1998, Spring 2002.
  • Enrolment Statistics (Spring 2000, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2000/M025