Number Theory and RSA - NMIB001
|
|
|
||
|
An introduction to fundamental concepts of number theory.
Focuses on primality testing and methods of integer factorization in connection with
RSA cryptosystem.
Last update: T_KA (17.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. Last update: T_KA (23.05.2003)
|
|
||
|
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.
Last update: T_KA (21.05.2004)
|