PřF:M8190 Number Theoretic Algorithms - Course Information
M8190 Number Theoretic Algorithms
Faculty of ScienceSpring 2006
- Extent and Intensity
- 2/0/0. 2 credit(s) (fasci plus compl plus > 4). 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. - Timetable
- Tue 15:00–16:50 N21
- Prerequisites
- Algebra II or Algebra 2
- 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
- there are 6 fields of study the course is directly associated with, display
- Course objectives
- The aim of the lecture is to show that results of number theory can help to factorize a given large positive integer into the product of prime numbers. The importance of this task grows up because of applications in coding theory.
- 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
- Study Materials
The course is taught once in two years. - Teacher's information
- ftp://www.math.muni.cz/pub/math/people/Kucera/lectures/atc.ps
- Enrolment Statistics (Spring 2006, recent)
- Permalink: https://is.muni.cz/course/sci/spring2006/M8190