MATA229 Cryptography (4 cr)
Study level:
Intermediate studies
Grading scale:
0-5
Language:
English, Finnish
Responsible organisation:
Department of Mathematics and Statistics
Curriculum periods:
2020-2021, 2021-2022, 2022-2023, 2023-2024
Description
Number theory, quotient rings Z/pZ, Euclidean algorithm, Fermat's little theorem, Chinese remainder theorem; symmetric and asymmetric encryption; DES, RSA, Rabin, Diffie-Hellman, ElGamal.
Learning outcomes
After completing the course the student
- understands the uses for which encryption methods are utilized
- has basic knowledge of the basic concepts associated with different encryption methods
- knows how to use congruence results to encrypt and decrypt messages
- understands the meaning of algorithmic computability
- understands security issues related to encryption methods
- has obtained both knowlegde and skills for standard applications
Description of prerequisites
Number theory 1
Study materials
Luentomoniste
Literature
- Johannes Buchmann, Introduction to Cryptography
- Jeffrey Hoffstein, Jill Pipher ja Joseph H. Silverman: An Introduction to Mathematical Cryptography
Completion methods
Method 1
Evaluation criteria:
Homework and Course exam
Select all marked parts
Method 2
Evaluation criteria:
Final exam
Select all marked parts
Parts of the completion methods
x
Teaching (4 cr)
Type:
Participation in teaching
Grading scale:
0-5
Language:
Finnish
Teaching
5/22–6/30/2023 Lectures
x
Exam (4 cr)
Type:
Exam
Grading scale:
0-5
Language:
English, Finnish