FI:M025 Number Theoretic Algoritmhs - Course Information
M025 Number Theoretic Algoritmhs
Faculty of InformaticsSpring 1998
- Extent and Intensity
- 2/1. 3 credit(s). 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
- Contact Person: prof. RNDr. Radan Kučera, DSc.
- Prerequisites
- M003 Linear Algebra I && M004 Linear Algebra 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
- Informatics (programme FI, B-IN)
- Informatics (programme FI, M-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
- Information Technology (programme FI, B-IN)
- 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.
- Language of instruction
- Czech
- Teacher's information
- http://www.math.muni.cz/ftp/ftp/pub/math/people/Kucera/lectures/
- Enrolment Statistics (Spring 1998, recent)
- Permalink: https://is.muni.cz/course/fi/spring1998/M025