Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Number Theory and RSA - NMIB001

Title:	Teorie čísel a RSA
Guaranteed by:	Department of Algebra (32-KA)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2018
Semester:	summer
E-Credits:	6
Hours per week, examination:	summer s.:2/2, C+Ex [HT]
Capacity:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	cancelled
Language:	Czech
Teaching methods:	full-time
Teaching methods:	full-time

Classification:	Mathematics > Algebra
Interchangeability :	NMMB206
Is incompatible with:	NMMB206
Is interchangeable with:	NMMB206

Opinion survey results Examination dates Schedule Noticeboard

Annotation -

Last update: T_KA (17.05.2003)

An introduction to fundamental concepts of number theory. Focuses on primality testing and methods of integer factorization in connection with RSA cryptosystem.

Literature - Czech

Last update: T_KA (23.05.2003)

Borevič, Šafarevič: Number Theory, Academic Press 1966;

Riesel: Prime numbers and computer methods for factorization, Birkhäuser 1985;

Cohen: A course in computational algebraic number theory, Springer-Verlag 1993.

Syllabus -

Last update: T_KA (21.05.2004)

Properties of integers with algebraic interpretation (Euler function, primitive elements, Gauss integers and squares). Quadratic residues and reciprocity law. RSA cryptosystem. Searching for prime numbers (prime numbers of special type, density of primes, Bertrand postulate). Simple composite-number tests (Carmichael numbers, Solovay-Strassen test, Rabin-Miller test). An outline of other methods used for primality testing and factorization. Continued fractions. Diophantine equations.