Inhalt

[ 201ZATHCRGU20 ] UE Cryptography

Versionsauswahl
Es ist eine neuere Version 2023W dieser LV im Curriculum Master's programme Computational Mathematics 2023W vorhanden.
(*) Unfortunately this information is not available in english.
Workload Education level Study areas Responsible person Hours per week Coordinating university
1,5 ECTS B3 - Bachelor's programme 3. year Mathematics 1 hpw Johannes Kepler University Linz
Detailed information
Original study plan Bachelor's programme Technical Mathematics 2020W
Objectives Introduction to relevant number theoretic results and methods as well as overview of cryptography, in particular, public key cryptography
Subject After a brief introduction to number theory we discuss selected results from cryptography. In particular we discuss the most important public key schemes, RSA and Diffie-Hellman key-exchange, algorithms for attacking the integer factoring problem and the discrete logarithm problem as well as primality tests.
Criteria for evaluation depending on the number of participants either oral or written tests and homeworks
Methods blackboard talks; exercises to be discussed in the tutorials
Language English and French
Study material Lecture notes are provided. For further reading we recommend in particular Chapter 2 of the textbook of H. Niederreiter and A. Winterhof: 'Applied Number Theory' as well as N. Koblitz: 'A course in number theory and cryptography‘ and Chapter 2 of W. Willems: 'Codierungstheorie und Kryptographie'.
Changing subject? No
Corresponding lecture (*)TM1WJUEKRYP: UE Kryptographie (1,5 ECTS)
Earlier variants They also cover the requirements of the curriculum (from - to)
TM1WJUEKRYP: UE Cryptography (2003S-2020S)
On-site course
Maximum number of participants 25
Assignment procedure Direct assignment