460-2065/01 – Basics of Cryptography (ZKB)
| Gurantor department | Department of Computer Science | Credits | 4 |
| Subject guarantor | RNDr. Eliška Ochodková, Ph.D. | Subject version guarantor | RNDr. Eliška Ochodková, Ph.D. |
| Study level | undergraduate or graduate | Requirement | Choice-compulsory type A |
| Year | 2 | Semester | summer |
| | Study language | Czech |
| Year of introduction | 2019/2020 | Year of cancellation | |
| Intended for the faculties | FEI | Intended for study types | Bachelor |
Subject aims expressed by acquired skills and competences
After graduation student will be able to:
1. Classify various kinds of attacks.
2. Classify particular security goals and security mechanisms dedicated to gain them.
3. Categorize cryptographic mechanisms.
4. Formulate mathematical background of cryptographic algorithms.
5. Design security mechanisms.
6. Demonstrate practical usage of cryptographic mechanisms and applied them.
7. Cooperate on project.
Teaching methods
Lectures
Tutorials
Summary
The primary aim of the course is to the basic principles of cryptographic algorithms. The basic definitions and construction of different cryptographic primitives, such as encryption schemes, digital signature schemes, or eg pseudorandom value generators and their applications in IT security, will be introduced. In particular, simple algorithms will be used to understand the basic chapters of numerical theory or algebraic structures theory.
Compulsory literature:
Recommended literature:
Schneier B.: Applied cryptography, John Wiley & Sons, New York, 1995 (2nd edition)
Pfleeger Ch.P.: Security in Computing, Prentice Hall, 1997 a pozdější
Gollmann D.: Computer Security , Wiley 2000
Way of continuous check of knowledge in the course of semester
- Solving problems assigned continuously at seminars.
- Final written test.
E-learning
Other requirements
There are no requirements.
Prerequisities
Subject has no prerequisities.
Co-requisities
Subject has no co-requisities.
Subject syllabus:
Syllabus of lectures:
1. Cryptography and its role in IT security. Basic concepts: security services, mechanisms, threats, attacks, risks, vulnerabilities and their examples.
2. Classical (historical) cryptography I. Examples of ciphers and their principles.
3. Classical (historical) cryptography II. Examples of ciphers and their principles in today's context.
4. Cryptanalysis - Methods and types of attacks on classical cipher. Ciphertext only attack.
5. Mathematical foundations of cryptographic algorithms I (congruence, modular arithmetic, primes).
6. Mathematical foundations of cryptographic algorithms II (algebraic structures (groups, fields)).
7. Modern cryptographic algorithms - symmetric cryptography. Basic principles, examples of algorithms (DES, AES) and ways of using them (modes of operation). Applications in protocols.
8. Modern cryptographic algorithms - asymmetric cryptography. Basic principles, examples of algorithms (RSA, Diffie-Hellman). Applications inprotocols.
9. Modern cryptographic algorithms - hash function. Principles and algorithms. Applications in protocols.
10. Modern Cryptographic Algorithms - Digital Signature. Principles and algorithms. Applications in protocols.
11. Pseudorandom Generators (PRNG). Principles and their applications for cryptographic purposes.
12. Authentication protocols and cryptographic algorithms.
13. Related legislation, standards.
Syllabus of seminars:
The seminars will take place in a computer classroom. They will include both the practical implementation of simple cryptographic algorithms and their demonstration in existing tools and aplications. The focus will also be on the mathematical principles of cryptography.
1. Basic cryptographic concepts and principles - practice, examples
2. Classical cryptography I.
3. Classical cryptography II.
4. Simulation of simple cryptanalytical attacks.
5. Practice of mathematical principles of algorithms discussed - modular arithmetic.
6. Algebraic structures.
7. Theory of Numbers.
8. Symmetric cryptography.
9. Asymmetric cryptography.
10. Hash functions.
11. OpenSSL, PGP.
12. PRNG.
13. Practical examples of security applications and protocols.
Conditions for subject completion
Occurrence in study plans
Occurrence in special blocks
Assessment of instruction