| Course Unit Code | 460-2065/01 |
|---|
| Number of ECTS Credits Allocated | 4 ECTS credits |
|---|
| Type of Course Unit * | Choice-compulsory type A |
|---|
| Level of Course Unit * | First Cycle |
|---|
| Year of Study * | Second Year |
|---|
| Semester when the Course Unit is delivered | Summer Semester |
|---|
| Mode of Delivery | Face-to-face |
|---|
| Language of Instruction | Czech |
|---|
| Prerequisites and Co-Requisites | Course succeeds to compulsory courses of previous semester |
|---|
| Name of Lecturer(s) | Personal ID | Name |
|---|
| OH140 | RNDr. Eliška Ochodková, Ph.D. |
| 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. |
| Learning Outcomes of the Course Unit |
|---|
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. |
| Course Contents |
|---|
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.
|
| Recommended or Required Reading |
|---|
| Required Reading: |
|---|
Simon Singh, The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography, 2000, ISBN:0385495323
Abraham Sinkov : Elementary Cryptanalysis: A Mathematical Approach, 1198 (a pozdější), ISBN-10: 0883856220
Stallings, W.: Cryptography and Network Security, Prentice Hall, 2005 (a pozdější), Print ISBN-10: 0-13-187316-4
Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone: Handbook of Applied Cryptography, CRC Press, ISBN:0-8493-8523-7, October 1996, 816 pages, http://www.cacr.math.uwaterloo.ca/hac/ |
Ochodková E., Matematické základy kryptografických algoritmů, 2011, http://mi21.vsb.cz/modul/matematicke-zaklady-kryptografickych-algoritmu
Simon Singh, Kniha kódů a šifer: Tajná komunikace od starého Egypta po kvantovou kryptografii, 2009, ISBN:978-80-7363-268-7
Abraham Sinkov : Elementary Cryptanalysis: A Mathematical Approach, 1198 (a pozdější), ISBN-10: 0883856220
Stallings, W.: Cryptography and Network Security, Prentice Hall, 2005 (a pozdější), Print ISBN-10: 0-13-187316-4
Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone: Handbook of Applied Cryptography, CRC Press, ISBN:0-8493-8523-7, October 1996, 816 pages, http://www.cacr.math.uwaterloo.ca/hac |
| Recommended Reading: |
|---|
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 |
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 |
| Planned learning activities and teaching methods |
|---|
| Lectures, Tutorials |
| Assesment methods and criteria |
|---|
| Task Title | Task Type | Maximum Number of Points
(Act. for Subtasks) | Minimum Number of Points for Task Passing |
|---|
| Graded credit | Graded credit | 100 | 51 |