PV181 Laboratory of security and applied cryptography

Faculty of Informatics
Autumn 2023
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).
Taught in person.
Lukasz Michal Chmielewski, PhD (lecturer)
prof. RNDr. Václav Matyáš, M.Sc., Ph.D. (alternate examiner)
Mgr. Marek Sýs, Ph.D. (lecturer)
Ing. Milan Brož, Ph.D. (seminar tutor)
Ing. Katarína Galanská (seminar tutor)
RNDr. Agáta Kružíková (seminar tutor)
Mgr. Milan Patnaik (seminar tutor)
Ing. Mgr. et Mgr. Zdeněk Říha, Ph.D. (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: Wed 16:00–17:50 B117, M. Brož, K. Galanská, L. Chmielewski, A. Kružíková, M. Sýs
PV181/02: Wed 14:00–15:50 B117, M. Brož, K. Galanská, L. Chmielewski, A. Kružíková, M. Sýs
PV181/03: Wed 10:00–11:50 B117, M. Brož, K. Galanská, L. Chmielewski, A. Kružíková, M. Sýs
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 36 student(s).
Current registration and enrolment status: enrolled: 33/36, only registered: 0/36, only registered with preference (fields directly associated with the programme): 0/36
fields of study / plans the course is directly associated with
there are 71 fields of study the course is directly associated with, display
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.
  • 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).
  • 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
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.
The course is also listed under the following terms Spring 2006, Autumn 2006, Spring 2007, Autumn 2007, Autumn 2008, Autumn 2009, Autumn 2010, Autumn 2011, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, Autumn 2017, Autumn 2018, Autumn 2019, Autumn 2020, Autumn 2021, Autumn 2022.
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2023/PV181