Main page | Study Branches/Specializations | Groups of Courses | All Courses | Roles                Instructions

A course is the basic teaching unit, it's design as a medium for a student to acquire comprehensive knowledge and skills indispensable in the given field. A course guarantor is responsible for the factual content of the course.
For each course, there is a department responsible for the course organisation. A person responsible for timetabling for a given department sets a time schedule of teaching and for each class, s/he assigns an instructor and/or an examiner.
Expected time consumption of the course is expressed by a course attribute extent of teaching. For example, extent = 2 +2 indicates two teaching hours of lectures and two teaching hours of seminar (lab) per week.
At the end of each semester, the course instructor has to evaluate the extent to which a student has acquired the expected knowledge and skills. The type of this evaluation is indicated by the attribute completion. So, a course can be completed by just an assessment ('pouze zápočet'), by a graded assessment ('klasifikovaný zápočet'), or by just an examination ('pouze zkouška') or by an assessment and examination ('zápočet a zkouška') .
The difficulty of a given course is evaluated by the amount of ECTS credits.
The course is in session (cf. teaching is going on) during a semester. Each course is offered either in the winter ('zimní') or summer ('letní') semester of an academic year. Exceptionally, a course might be offered in both semesters.
The subject matter of a course is described in various texts.

BI-KAB.21 Cryptography and Security Extent of teaching: 2P+2C
Instructor: Lórencz R. Completion: Z,ZK
Department: 18106 Credits: 5 Semester: L

Annotation:
Students will understand the mathematical foundations of cryptography and gain an overview of current cryptographic algorithms. They will be able to use cryptographic keys and certificates in systems based on them and learn the basics of safe use of symmetric and asymmetric cryptographic systems and hash functions in applications. Within labs, students will gain practical skills in using standard cryptographic methods with an emphasis on security and will also get acquainted with the basic procedures of cryptanalysis.

Lecture syllabus:
1. Basic concepts in cryptology and computer security. Historical ciphers.
2. Exponential cipher, shared key establishment, and discrete logarithm problem.
3. Taxonomy of ciphers. Stream ciphers - RC4, A5/1, ChaCha20.
4. Block ciphers - 3DES, AES, Twofish. Operating modes of block ciphers.
5. Hash functions, SHA-x and HMAC.
6. Factorization problem, asymmetric cryptography, RSA, ElGamal.
7. Primality testing, Rabin-Miller test, key generation.
8. Security of cryptographic systems in terms of information theory and computational complexity.
9. Basics of elliptic curve cryptography.
10. Pseudorandom and true random number generators.
11. Quantum cryptography and post-quantum cryptography.
12. Public key infrastructure.
13. IT security.

Seminar syllabus:
1. Basics of modular arithmetic (repetition), historical ciphers.
2. Block ciphers (Hill, exponential cipher), Diffie-Hellman algorithm.
3. Stream ciphers. Hash functions.
4. Information theory (entropy, distance of uniqueness).
5. Block ciphers (AES), modes of operation.
6. Asymmetric cryptography (RSA, ElGamal).
7. Random number generators. Primality testing.
8. Use of cryptographic libraries.
9. Certificates. TLS encryption on the network.
10. Current trends in cryptography.

Literature:
1. Padhye S., Sahu R. A., Saraswat V. : Introduction to Cryptography. CRC Press, 2018. ISBN 9781138071537.
2. Aumasson J.-P. : Serious Cryptography. A Practical Introduction to Modern Encryption. No Starch Press, 2017. ISBN 978-1593278267.
3. Rosen K. H. : Elementary Number Theory (5th Edition). Addison Wesley, 2004. ISBN 321237072.
4. Sadler T. L. : Cybersecurity for Everyone: Securing Your Home or Small Business Network. Signalman Publishing, 2014. ISBN 9781940145365.
5. Paar CH., Pelzl J. : Understanding Cryptography. Springer, 2009. ISBN 3642446498.

Requirements:
Entry knowledge: Fundamentals of linear algebra and discrete mathematics. Basics of number theory, elementary programming techniques. Knowledge of runtime and memory complexities.

Chybí webová strana předmětu

The course is also part of the following Study plans:
Study Plan Study Branch/Specialization Role Recommended semester
BI-SPOL.21 Unspecified Branch/Specialisation of Study PP 4
BI-PI.21 Computer Engineering 2021 (in Czech) PP 4
BI-PG.21 Computer Graphics 2021 (in Czech) PP 4
BI-MI.21 Business Informatics 2021 (In Czech) PP 4
BI-IB.21 Information Security 2021 (in Czech) PP 4
BI-PS.21 Computer Networks and Internet 2021 (in Czech) PP 4
BI-PV.21 Computer Systems and Virtualization 2021 (in Czech) PP 4
BI-SI.21 Software Engineering 2021 (in Czech) PP 4
BI-TI.21 Computer Science 2021 (in Czech) PP 4
BI-UI.21 Artificial Intelligence 2021 (in Czech) PP 4
BI-WI.21 Web Engineering 2021 (in Czech) PP 4


Page updated 29. 3. 2024, semester: L/2021-2, Z,L/2023-4, Z/2021-2, Z/2020-1, Z/2019-20, L/2020-1, Z,L/2022-3, L/2019-20, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška