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.

NI-AIB Algorithms of Information Security Extent of teaching: 2P+1C
Instructor: Jureček M., Lórencz R. Completion: Z,ZK
Department: 18106 Credits: 5 Semester: Z

Annotation:
Students will get acquainted with the algorithms of secure key generation and cryptographic error (not only biometric) data processing. Furthermore, students will learn the mathematical principles of cryptographic protocols (identification, authentication, and signature schemes). Another part of the course is dedicated to malware detection and the use of machine learning in detection systems. The last topic includes practical steganographic methods and attacks on steganographic systems.

Lecture syllabus:
1. Key generation algorithms.
2. Self-correcting codes (basic definition, Reed-Muller codes).
3. Self-correcting codes (cyclic codes, Reed-Solomon, and BCH codes).
4. Cryptographic methods of error data processing (biometric data).
5. Cryptographic protocols: zero-knowledge proofs.
6. Cryptographic protocols: electronic signature and identification schemes.
7. Cryptographic protocols: key management, secret sharing.
8. Malware: basic types of malware and principles of analysis.
9. Malware: machine learning-based detection techniques.
10. Malware: algorithms for clustering into families.
11. Steganography: practical steganographic methods.
12. Steganography: attacks on steganographic systems.

Seminar syllabus:
1. Key generation algorithms.
2. Self-correcting codes
3. Cryptographic protocols
4. Cryptographic protocols
5. Malware
6. Steganography

Literature:
1. Monnappa, K. A. : Learning Malware Analysis: Explore the concepts, tools, and techniques to analyze and investigate Windows malware. Packt Publishing, 2018. ISBN 978-1788392501.
2. Masud, M. - Thuraisingham, B. - Khan, L. : Data mining tools for malware detection. Auerbach Publications, 2011. ISBN 978-1439854549.
3. Clark, C. : Bitcoin Internals - A Technical Guide to Bitcoin. Amazon Digital Services, 2013.
4. Fridrich, J. : Steganography in digital media: principles, algorithms, and applications. Cambridge University Press, 2009. ISBN 978-0521190190.
5. Mao, W. : Modern cryptography: theory and practice. Pearson Education India, 2003. ISBN 978-0132887410.

Requirements:
Knowledge of linear algebra (BI-LIN), probability theory (BI-PST) and information security (BI-BEZ).

Informace o předmětu a výukové materiály naleznete na

The course is also part of the following Study plans:
Study Plan Study Branch/Specialization Role Recommended semester
NI-SPOL.2020 Unspecified Branch/Specialisation of Study VO 3
NI-TI.2018 Computer Science V 3
NI-SP.2020 System Programming V 3
NI-SP.2023 System Programming V 3
NI-TI.2023 Computer Science V 3
NI-TI.2020 Computer Science V 3
NI-ZI.2020 Knowledge Engineering V 3
NI-PB.2020 Computer Security PS 3
NI-SI.2020 Software Engineering (in Czech) V 3
NI-MI.2020 Managerial Informatics V 3
NI-NPVS.2020 Design and Programming of Embedded Systems V 3
NI-PSS.2020 Computer Systems and Networks V 3
NI-WI.2020 Web Engineering V 3
NIE-DBE.2023 Digital Business Engineering VO 3


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