Skip to main content

Cryptography and computer security

Computer Science and Mathematics, Second Cycle
1 ali 2 year
first or second
slovenian, english
Course director:

Prof. Dr. Aleksandar Jurišić

Hours per week – 1. or 2. semester:

There are no prerequisites.

Content (Syllabus outline)

Information/Computer Security describes all preventive measures, procedures and means to ensure access to Information Systems and their contents in order to prevent their unauthorized use. Cryptography provides maximum security while at the same time preserve the flexibility of digital media. It forms the foundation of Information Society (objectives: privacy, data integrity, digital authentication/signatures, digital cash, and other cryptographic protocols, it covers: Mathematics, Computer Science, Electrical Engineering, Finances, Policy, Defense, etc.). The course will cover the following topics:
• Symmetric cryptography
– Classical Ciphers and History of Cryptography
– Kerckhoff Principle and various attacks on cryptosystems
– Shannon Theory of Information and Entropy (Perfect, Computational and Provable Security)
– Block Ciphers (DES/IDEA, AES and finalists, Linear and Differential Analysis)
– Stream Ciphers/PRNG (RC4, LFSR and Berlekamp-Massey algorithm,...),
– Cryptoanalysis, Statistical Methods
– Hash Functions (MD/SHA, HMAC...)
and Authentication Codes (MAC),
Birthday Paradox Attacks, new attacks,...
• Public-key cryptography (Asymmetric Cryptography)
– Perfect Security (Computational,
Unconditional and Provable Security)
– Public-Key Cryptosystems, One-Way
Functions and related problems in Number Theory (Primality Testing, Integer
Factorization, Discrete Logarithem Problem)
– Digital Signatures (RSA, DSA, one-time, blind, group etc.)
– Key Agreement Protocols (Diffie-Hellman, ElGamal, Kerberos, STS)
– Identification Schemes for humans and devices (challenge/response...)
– Other protocols (head/tail over the phone, mental poker, Secret Sharing Schemes, Authentication Schemes, Timestamps, Visual Cryptography, Zero-Knowledge Proofs)
– Quantum Cryptography
• Computer/information security
– Security of programs (bugs, viruses,
malicious code)
– Security of databases (anonymization)
– Security of OS (MS Win, Unix/Linux, liveCD)
– Security of network communication
(firewalls, VPN, IPSec, SSL)
– Privacy in Computer Science (tokens/smart cards, RFID cards)
– Key management (certificates, CA, PKI, X.509)
– Efficient and secure implementations of cryptosystems (sidechanell
attacks and defenses against them)
– Real time security management
(security policy, monitoring)– Patents and standards (ISO, IEEE, IETF)

  1. A. J. Menezes, P. C. van Oorschot, S. A. Vanstone: Handbook of applied cryptography, Boca Raton : CRC Press, cop. 1997.
  2. C. P. Pfleeger, S.L. Pfleeger: Security in computing, 4th ed., Upper Saddle River (NJ) : Prentice Hall, cop. 2007.
  3. D. R. Stinson: Cryptography : theory and practice, 3rd ed. - Boca Raton : Chapman & Hall/CRC, cop. 2006.
Objectives and competences

Introduction to Cryptography and Computer Security.

Intended learning outcomes

After successful completition of this course the students will be able to:

  • master the basic problems of computer security and the detailed structure of the most famous
    cryptosystems and will be capable to connect these areas, propose specific solutions and implement or maintain cryptosystems,

  • apply, i.e., be able to define the problem, correctly evaluate it from a professional point of view (both
    cryptographic and security) and to propose/evaluate an effective solution,

  • understand the connection between theory and practice applied to specific examples of computer
    This course is a foundation for several courses that study computer systems and networks,
    telecommunications, digital forensics, electronic and mobile commerce, etc. Students will gain a
    theoretical foundation for a variety of practical problems that are encountered in the field of computer security and cryptography.

Learning and teaching methods

Lectures, tutorials, assignments, seminars, office hours, lab work. There will be a special emphasis on real-time studies and team work (tutorials and seminars). We will occasionally watch a video material related to the course material.


Active participation and short presentation of master thesis in the first semester
Final (written and oral exam)
grading: 5 (fail), 6-10 (pass) (according to the Statute of UL)

Lecturer's references

JURIŠIĆ, Aleksandar, KOOLEN, Jack. Classification of the family AT4(qs,q,q) of antipodal tight graphs. Journal of combinatorial theory. Series A, ISSN 0097-3165, 2011, vol. 118, iss. 3, str. 842-852. [COBISS-SI-ID 15875417]
BROUWER, Andries E., JURIŠIĆ, Aleksandar, KOOLEN, Jack. Characterization of the Patterson graph. Journal of algebra, ISSN 0021-8693, 2008, vol. 320, iss. 5, str. 1878-1886. [COBISS-SI-ID 14632537]
JURIŠIĆ, Aleksandar, KOOLEN, Jack. Distance-regular graphs with complete multipartite [mu]-graphs and AT4 family. Journal of algebraic combinatorics, ISSN 0925-9899, 2007, vol. 25, no. 4, str. 459-471. [COBISS-SI-ID 14370393]
JURIŠIĆ, Aleksandar. AT4 family and 2-homogeneous graphs. Discrete Mathematics, ISSN 0012-365X. [Print ed.], 2003, vol. 264, no. 1-3, str. 127-148. [COBISS-SI-ID 12515673]
JURIŠIĆ, Aleksandar, KOOLEN, Jack. A local approach to 1-homogeneous graphs. Designs, codes and cryptography, ISSN 0925-1022, 2000, let. 21, str. 127-147. [COBISS-SI-ID 10205017]
JURIŠIĆ, Aleksandar, KOOLEN, Jack, TERWILLIGER, Paul. Tight distance-regular graphs. Journal of algebraic combinatorics, ISSN 0925-9899, 2000, vol. 12, no. 2, str. 163-197. [COBISS-SI-ID 10277465]