Teaching
Winter 2023
- NI(E)-AIB Algorithms of Information Security (in Slovak, English)
Summer 2024
- NI(E)-MKY Mathematics for Cryptology (in Slovak, English)
- Algorithms of Information Security
- Mathematics for Cryptology
- Cryptography and Security
- Elements of Calculus
- Matouš Kozák, Adversarial Learning Techniques for Malware Detection, expected 2027
- Benjamín Peraus, Reducing the Surface for Adversarial Attacks in Malware Detectors, expected 2028
Master theses
- Tomáš Faikl, Algebraic Cryptanalysis of Small Scale Variants of the AES Based on Lattice Basis Reduction, expected 2025
- Benjamín Peraus, Reducing the Surface for Adversarial Attacks in Malware Detectors, defended 2024
- Lukáš Děd, Selection of Representative Samples from Datasets for Malware Detection E0, defended 2024, Dean's Award
- Jan Dolejš, Algebraic Cryptanalysis of Small-Scale Variants of Stream Cipher E0, defended 2024, Dean's Award
- Mehmet Efe Zorlutuna, Unsupersived Instance Selection for Malware Detection, defended 2023
- Daniel Minarovič, Algebraic Cryptanalysis of Small Scale Variants of the Grain (in Slovak), defended 2023
- Pavla Louthánová, A Comparison of Adversarial Learning Techniques for Malware Detection, defended 2023, Dean's Award
- Matouš Kozák, Application of Reinforcement Learning to Creating Adversarial Malware Samples, defended 2023, Dean's Award
- Jana Berušková, Reducing Overdefined Systems of Polynomial Equations Derived from Small Scale Variants of the AES (in Czech), defended 2023
- Tomáš Zvára, Generating Malware Family Signatures from Behavioral Graphs using Unsupervised Learning, defended 2022
- Jiří Soukup, Algebraic Cryptanalysis of LFSR-based Stream Ciphers (in Czech), defended 2022
- Marek Bielik, Algebraic Cryptanalysis of Small Scale Variants of the AES, defended 2021, SVOČ 2021 third place
- Libor Šlechta, Simulation of Malware Detection Model (in Czech), defended 2020
- Michal Buchovecký, Semi-supervised Learning for Malware Detection (in Slovak), defended 2019
Bachelor theses
- Marek Holík, Hard Mathematical Problems in Cryptography, defended 2022
- Jan Dolejš, Interpretability of Machine Learning-based Results of Malware Detection using a Set of Rules, defended 2021, Dean's Award
- Petr Horák, Cryptanalysis of RSA Based on Factorization, defended 2020
- Matouš Kozák, Static Malware Detection Using Recurrent Neural Networks, defended 2020
- Jakub Ács, Static Detection of Malicious PE Files, defended 2018
- Tomáš Hradský, Real Time Attack of A5/1 (in Czech), defended 2015
- Martin Holec, Correlation Attack on A5/1, defended 2015