FI:PV181 Lab - security, appl. crypto - Course Information
PV181 Laboratory of security and applied cryptography
Faculty of InformaticsAutumn 2024
- Extent and Intensity
- 0/2/1. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).
In-person direct teaching - Teacher(s)
- Lukasz Michal Chmielewski, PhD (lecturer)
Mgr. Marek Sýs, Ph.D. (lecturer)
Ing. Milan Brož, Ph.D. (seminar tutor)
Ing. Katarína Galanská (seminar tutor)
Mgr. Milan Patnaik (seminar tutor)
Ing. Mgr. et Mgr. Zdeněk Říha, Ph.D. (seminar tutor)
RNDr. Agáta Kružíková, Ph.D. (seminar tutor)
prof. RNDr. Václav Matyáš, M.Sc., Ph.D. (lecturer)
Bc. David Rajnoha (seminar tutor) - Guaranteed by
- prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Contact Person: prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Supplier department: Department of Computer Systems and Communications – Faculty of Informatics - Timetable of Seminar Groups
- PV181/01: Thu 26. 9. to Thu 19. 12. Thu 10:00–11:50 B116, M. Brož, K. Galanská, L. Chmielewski, A. Kružíková, M. Sýs
PV181/02: Thu 26. 9. to Thu 19. 12. Thu 14:00–15:50 B116, M. Brož, K. Galanská, L. Chmielewski, A. Kružíková, M. Sýs
PV181/03: Thu 26. 9. to Thu 19. 12. Thu 16:00–17:50 B116, M. Brož, K. Galanská, L. Chmielewski, A. Kružíková, M. Sýs - Prerequisites
- Registration to PV181 requires: 1) long-term interest in IT security; 2) programming skills (ideally C and Java) under Unix/Linux or Win32; 3) fluent English.
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 42 student(s).
Current registration and enrolment status: enrolled: 39/42, only registered: 0/42, only registered with preference (fields directly associated with the programme): 0/42 - fields of study / plans the course is directly associated with
- Image Processing and Analysis (programme FI, N-VIZ)
- Bioinformatics and systems biology (programme FI, N-UIZD)
- Computer Games Development (programme FI, N-VIZ_A)
- Computer Graphics and Visualisation (programme FI, N-VIZ_A)
- Computer Networks and Communications (programme FI, N-PSKB_A)
- Cybersecurity Management (programme FI, N-RSSS_A)
- Discrete algorithms and models (programme FI, N-TEI)
- Formal analysis of computer systems (programme FI, N-TEI)
- Graphic design (programme FI, N-VIZ)
- Graphic Design (programme FI, N-VIZ_A)
- Hardware Systems (programme FI, N-PSKB_A)
- Hardware systems (programme FI, N-PSKB)
- Image Processing and Analysis (programme FI, N-VIZ_A)
- Information security (programme FI, N-PSKB)
- Information Security (programme FI, N-PSKB_A)
- Quantum and Other Nonclassical Computational Models (programme FI, N-TEI)
- Computer graphics and visualisation (programme FI, N-VIZ)
- Computer Networks and Communications (programme FI, N-PSKB)
- Principles of programming languages (programme FI, N-TEI)
- Cybersecurity management (programme FI, N-RSSS)
- Services development management (programme FI, N-RSSS)
- Software Systems Development Management (programme FI, N-RSSS)
- Services Development Management (programme FI, N-RSSS_A)
- Software Systems Development Management (programme FI, N-RSSS_A)
- Software systems (programme FI, N-PSKB)
- Machine learning and artificial intelligence (programme FI, N-UIZD)
- Teacher of Informatics and IT administrator (programme FI, N-UCI)
- Informatics for secondary school teachers (programme FI, N-UCI) (2)
- Computer Games Development (programme FI, N-VIZ)
- Processing and analysis of large-scale data (programme FI, N-UIZD)
- Natural language processing (programme FI, N-UIZD)
- Course objectives
- The aim of this subject is to understand the implementation details of cryptographic algorithms and protocols and to be able to apply the gained knowledge in practice. At the end of the course, students should be able to design and implement cryptographic applications relying on the most commonly-used crypto-libraries.
- Learning outcomes
- To teach the students to:
select appropriate cryptographic function according to requirements;
understand basic-level issues of implementing cryptographic applications;
apply the gained knowledge in practice;
compare crypto functions and libraries in terms of efficiency and level of abstraction;
independently design and implement simple cryptographic applications in various environments;
evaluate crypto applications in terms of their security and efficiency. - Syllabus
- Principles of cryptography and cryptographic standards (symmetric cryptography, random number generation, hash functions, asymmetric cryptography, certificates, certification authority, PKI). Using cryptographic libraries in crypto-applications (OpenSSL, Java, Microsoft Crypto API). Digital Signatures (including CMS/PKCS#7 structure). Formats of common cryptographic files (keys, certificates, ASN.1). Biometric systems (fingerprint, face). Hardware security aspects of crypto-libraries (side-channel analysis, fault injection).
- Literature
- Schneier's cryptography classics library :applied cryptography, secrets and lies, and practical cryptography. ISBN 978-0-470-22626-1. info
- VAUDENAY, Serge. A classical introduction to cryptography : applications for communications security. New York: Springer, 2006, xviii, 335. ISBN 0387254641. info
- Teaching methods
- seminars in a security lab, homeworks
- Assessment methods
- Two hours per week are scheduled for seminars, otherwise students work on projects, homeworks etc. in their free time. There are 12 homeworks (10 points each). To get the credit (Z) 50% of the points is required, to get the colloquium (P) 65% of the points is required.
- Language of instruction
- English
- Follow-Up Courses
- Further comments (probably available only in Czech)
- Study Materials
The course is taught annually. - Teacher's information
- Seminar groups include 10-12 students.
- Enrolment Statistics (recent)
- Permalink: https://is.muni.cz/course/fi/autumn2024/PV181