FI:PV079 Applied Cryptography - Course Information
PV079 Applied Cryptography
Faculty of InformaticsAutumn 2024
- Extent and Intensity
- 1/1/2. 4 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium).
In-person direct teaching - Teacher(s)
- Mgr. Marek Sýs, Ph.D. (lecturer)
prof. RNDr. Václav Matyáš, M.Sc., Ph.D. (lecturer)
RNDr. Jiří Kůr, Ph.D. (assistant)
RNDr. Marek Kumpošt, Ph.D. (assistant)
RNDr. Ján Jančár (seminar tutor)
RNDr. Vojtěch Suchánek (seminar tutor)
RNDr. Antonín Dufka (seminar tutor)
RNDr. Andrij Stecko, Ph.D. (assistant)
Mgr. Jan Kvapil (assistant)
Lukasz Michal Chmielewski, PhD (lecturer) - 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
- Wed 25. 9. to Wed 18. 12. Wed 12:00–13:50 D2
- Prerequisites
- IV054 Cryptography and C.Protocols || PřF:M0170 Cryptography || IA174 Fundaments of Cryptography || NOW( IA174 Fundaments of Cryptography ) || SOUHLAS
It is recommended to register this course after a fundamental cryptography course (IA174 or another full-semester cryptography course), and for Master students a parallel registration of this course with such a basic cryptography course will be allowed. - Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- 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)
- Informatics (programme FI, B-INF) (2)
- Informatics in education (programme FI, B-IVV) (2)
- 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)
- Programming and development (programme FI, B-PVA)
- 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
- To teach the students to:
understand intermediate-level issues of deploying cryptographic mechanisms;
apply a crypto or security standard to fit the solution sought;
judge pros and cons of crypto methods considered for deployment;
independently design and test simple cryptographic solutions;
evaluate common crypto protocols in terms of their security and efficiency. - Learning outcomes
- At the end of the course students will be able to:
understand intermediate-level issues of deploying cryptographic mechanisms;
apply a crypto or security standard to fit the solution sought;
judge pros and cons of crypto methods considered for deployment;
independently design and test simple cryptographic solutions;
evaluate common crypto protocols in terms of their security and efficiency. - Syllabus
- This course explores the issues of applied cryptography issues,
and topics cover:
Relations of symmetric and asymmetric cryptography. - Generation of random and pseudorandom sequences.
- Hash functions and their applications.
- Digital signatures, MAC. Non-repudiation.
- Cryptographic protocols, entity authentication.
- Public key infrastructure, certification.
- Cryptanalysis.
- Patents and standards.
- Application of cryptography in selected systems - dedicated hardware security modules, wireless sensor networks, smartcards, privacy enhancing technologies.
- This course explores the issues of applied cryptography issues,
and topics cover:
- Literature
- recommended literature
- MENEZES, Alfred, Paul C. VAN OORSCHOT and Scott A. VANSTONE. Handbook of applied cryptography. Boca Raton: CRC Press, 1997, xxviii, 78. ISBN 0849385237. URL info
- not specified
- VAN OORSCHOT, Paul C. Computer security and the Internet : tools and jewels. Cham: Springer, 2020, xxiii, 365. ISBN 9783030336486. info
- Teaching methods
- lecture, non-trivial assignments (home work) of applied nature
- Assessment methods
- Final "open book" exam accounts for 50% and assignments also for 50% of the final grade. Both the course and the final exam are in English.
- Language of instruction
- English
- Follow-Up Courses
- Further Comments
- Study Materials
The course is taught annually. - Listed among pre-requisites of other courses
- Enrolment Statistics (recent)
- Permalink: https://is.muni.cz/course/fi/autumn2024/PV079