Cryptography and Cryptoanalysis

Course Description

This course gives an introduction to basic paradigms and principles of modern cryptography, with an emphasis on the fundamental cryptographic primitives of symmetric and public-key encryption, basic cryptanalysis, hash functions, and digital signatures.

Learning Outcomes

  1. apply symmetric cryptographic algorithms
  2. apply asymmetric cryptographic algorithms
  3. apply hash functions
  4. assemble symmetric and asymmetric algorithms into complex cryptosystems such as digital envelope
  5. illustrate authentication protocols and key exchange protocols
  6. explain and illustrate attacks on cryptographic primitives
  7. defend against cryptographic systems attacks

Forms of Teaching


Once a week.


Laboratory exercises are done independently as part of homework.

Grading Method

Continuous Assessment Exam
Type Threshold Percent of Grade Threshold Percent of Grade
Laboratory Exercises 0 % 20 % 0 % 0 %
Quizzes 0 % 10 % 0 % 0 %
Mid Term Exam: Written 0 % 30 % 0 %
Final Exam: Written 0 % 40 %

Week by Week Schedule

  1. Perfect secrecy and one-time pad. Cipher types together with typical attack methods such as frequency analysis.
  2. Block ciphers DES, 3DES i AES. Feistel network.
  3. Block ciphers and modes of operation.
  4. Message integrity and hashing. Merkle-Damgard and sponge constructions. Pseudorandom number generators.
  5. Security definition of asymetric cryptosystem. RSA cryptosystem.
  6. Diffie-Hellman protocol and ElGamal cryptosystem. Introduction to digital signature: security definition.
  7. RSA and DSA digital signature.
  8. Midterm exam
  9. Public Key Infrastructure support for digital signature and encryption and its challenges.
  10. Cryptanalysis. Security definitions and attacks on cryptographic primitives. Brute-force attack. Side-channel attacks.
  11. Cryptographic protocols: authentication and key exchange. Protocol TLS.
  12. Challenge-response authentication, zero-knowledge protocols, commitment and secret sharing.
  13. Quantum attacks and quantum-resilient cryptography. Grover's algorithm and symmetric crypto, Shor's algorithm and public key crypto. Post-quantum crypto. Quantum key exchange protocol BB84.
  14. Motivate concepts using real-world applications, e.g., electronic cash, secure channels between clients and servers, voting systems. Cryptographic standards and references implementations.
  15. Final exam

Study Programmes

University graduate
Audio Technologies and Electroacoustics (profile)
Free Elective Courses (1. semester)
Communication and Space Technologies (profile)
Free Elective Courses (1. semester)
Computational Modelling in Engineering (profile)
Free Elective Courses (1. semester)
Computer Engineering (profile)
Elective Course of the Profile (1. semester)
Computer Science (profile)
Core-elective courses (1. semester)
Control Systems and Robotics (profile)
Free Elective Courses (1. semester)
Data Science (profile)
Free Elective Courses (1. semester)
Electrical Power Engineering (profile)
Free Elective Courses (1. semester)
Electric Machines, Drives and Automation (profile)
Free Elective Courses (1. semester)
Electronic and Computer Engineering (profile)
Free Elective Courses (1. semester)
Electronics (profile)
Free Elective Courses (1. semester)
Information and Communication Engineering (profile)
Elective Courses of the Profile (1. semester)
Network Science (profile)
Free Elective Courses (1. semester)
Software Engineering and Information Systems (profile)
Elective Course of the Profile (1. semester)


Budin, L.; Golub, M; Jakobovic, D., Jelenkovc, L (2010.) (2013.), Operacijski sustavi, Element, Zagreb
(.), Christof Paar, Jan Pelzl, Understanding Cryptography, Springer-Verlag Berlin Heidelberg, 2009.,
(.), Nigel P. Smart, Cryptography Made Simple, Springer International Publishing, 2016.,

For students


ID 222637
  Winter semester
L1 English Level
L1 e-Learning
45 Lectures
10 Laboratory exercises

Grading System

88 Excellent
75 Very Good
63 Good
50 Acceptable

Similar Courses