FI:PV181 Lab - security, appl. crypto - Course Information
PV181 Laboratory of security and applied cryptographyFaculty of Informatics
- 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).
- Mgr. Marek Sýs, Ph.D. (lecturer)
prof. RNDr. Václav Matyáš, M.Sc., Ph.D. (alternate examiner)
Ing. Milan Brož, Ph.D. (seminar tutor)
Mgr. Vít Bukač, Ph.D. (seminar tutor)
RNDr. Dušan Klinec (seminar tutor)
RNDr. Petr Ročkai, Ph.D. (seminar tutor)
Ing. Mgr. et Mgr. Zdeněk Říha, Ph.D. (seminar tutor)
RNDr. Vlasta Šťavová, Ph.D. (seminar tutor)
RNDr. Martin Ukrop (seminar tutor)
RNDr. Andrij Stecko, Ph.D. (alternate examiner)
- Guaranteed by
- doc. RNDr. Eva Hladká, 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 8:00–9:50 A403, M. Brož, D. Klinec, P. Ročkai, Z. Říha, M. Sýs, V. Šťavová, M. Ukrop
PV181/02: Wed 10:00–11:50 A403, M. Brož, D. Klinec, P. Ročkai, Z. Říha, M. Sýs, V. Šťavová, M. Ukrop
PV181/03: Wed 12:00–13:50 A403, M. Brož, D. Klinec, P. Ročkai, Z. Říha, M. Sýs, V. Šťavová, M. Ukrop
PV181/04: Wed 16:00–17:50 A403, M. Brož, D. Klinec, P. Ročkai, Z. Říha, M. Sýs, V. Šťavová, M. Ukrop
- 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 48 student(s).
Current registration and enrolment status: enrolled: 12/48, only registered: 0/48, only registered with preference (fields directly associated with the programme): 0/48
- fields of study / plans the course is directly associated with
- there are 38 fields of study the course is directly associated with, display
- Course objectives
- The aim of this subject is to understand 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 independently.
- Learning outcomes
- To teach the students to:
select appropriate cryptographic functions;
understand basic-level issues of implementating cryptographic applications;
apply the gained knowledge in practice;
judge pros and cons of crypto functions ;
independently design and implement simple cryptographic applications in various enviroments;
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 cryptoaplications (OpenSSL, Cryptlib, Microsoft Crypto API, Java). Digital Signatures (CMS/PKCS#7 structure, S/MIME, Czech legislation). Formats of commmon cryptographic files (keys, certificates, ASN.1). Biometric systems (fingerprint, face).
- 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) 70% 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.