|
|
|||||||||||||||||
Course Catalog 2011-2012
MAT-52606 Mathematical Cryptology, 6 cr |
Additional information
The course is lectured biennially.
Suitable for postgraduate studies
Person responsible
Keijo Ruohonen
Lessons
| Study type | P1 | P2 | P3 | P4 | Summer | Implementations | Lecture times and places |
|
|
|
|
|
|
|
|
|
Requirements
Closed-book written exam.
Completion parts must belong to the same implementation
Learning outcomes
After completing the course the student is familiar with the mostly used cryptosystems in modern cryptography, and their basic properties. The student also masters the required prerequisites in number theory and algebra. In particular, the student identifies the division of algorithms into intractable and tractable, so essential in cryptography. Completing the course the student is able to identify common cryptosystems, and evaluate their advantages and disadvantages, and the underlying mathematical paradigms, and for cryptographic protocols, too, to an extent (this is however mostly left to the relevant courses in telecommunications). Despite modern cryptology being the result of relatively recent research, it has progressed far and wide, and therefore it is simply not possible to include outcomes for them all within a single course. Completing the course the student nevertheless should be able the generalize and extend the skills.
Content
| Content | Core content | Complementary knowledge | Specialist knowledge |
| 1. | Elements and basic algorithms of number theory and algebra. Simple examples. | Applications to analysis of more complex cases. Alternative algorithms. | |
| 2. | The AES cryptosystem, its goals and algebraic background. | Further analysis of the AES cryptosystem. | |
| 3. | Computational complexity and its relation to cryptographic concerns, in particular for public-key systems. | ||
| 4. | The RSA cryptosystem, its goals, analyses and number-theoretic background. | Further analysis of RSA, its variants and special uses. | |
| 5. | Cryptosystems based on group-theoretic concepts: ELGAMAL, DIFFIE-HELLMAN, elliptic curve system. | Further analyses of these systems, their variants and special uses. | |
| 6. | Overview of the NTRU cryptosystem. | Further analysis and structure of NTRU. | |
| 7. | Quantum encryption, its background and systems. |
Evaluation criteria for the course
Final grade is determined from tutorial activity and the final closed-book exam. Passing the course requires passing the final exam, and for this at most half of the maximum points are required. Bonus points obtained by tutorial activity may be used to add the exam points according to a given scheme. A thorough mastering of the core content should be sufficient for passing the course with grade 3. To get the degree 4 at least some complementary knowledge is usually required, getting the grade 5 then requires a more thorough mastering of this knowledge.
Assessment scale:
Numerical evaluation scale (1-5) will be used on the course
Partial passing:
Study material
| Type | Name | Author | ISBN | URL | Edition, availability, ... | Examination material | Language |
| Other online content | Homepage | English | |||||
| Summary of lectures | An Introduction to Cryptography | Mollin, R.A. | English | ||||
| Summary of lectures | Cryptography. Theory and Practice | Stinson, D.R. | English | ||||
| Summary of lectures | Mathematical Cryptology | Ruohonen, K. | English |
Prerequisite relations (Requires logging in to POP)
Correspondence of content
| Course | Corresponds course | Description |
|
|
|
More precise information per implementation
| Implementation | Description | Methods of instruction | Implementation |
| Lectures and tutorials of Mathematical Cryptology |