All pdf or postscript (ps) files can be viewed using Adobe Reader or Ghostscript and GSview, which can be downloaded and installed by clicking to: . or (for windows you have to get gs814w32.exe and gsv46w32.exe, so follow this link).

Courses taught

University of Ljubljana, Depratment of Mathematics

• Topics in Algebraic Combinatorics
  graduate studies in theoretical mathematics: 06/07,
• Cryptography
  graduate studies in education of mathematics: 03/04, 99/00
  graduate studies in theoretical mathematics: 98/99
• Sequence Analysis, graduate studies in theoretical mathematics - reading course: 2001
• Coding theory, graduate studies in theoretical mathematics - reading course: 2002

University of Ljubljana, Faculty of Computer and Information Science

• Cryptography and Computer Security (graduate studies: Winter 2006, W04, W02, W00)
• Statistics and Data Analysis (undergraduate studies: W99)

Univerza na Primorskem, PEF

• Graph Theory (undergraduate studies, W06)

University of Waterloo, Facutly of Mathematics

• Applied Linear Algebra 1, MATH 125 (undergraduate studies: Spring 1994)

Nova Gorica Polytechnic

• Mathematics (School of Environmental Sciences, undergraduate studies: 04/05, 03/04, 02/03, 01/02, 00/01)
• Mathematics (School of Engineering and Management, undergraduate studies: 04/05, 99/00, 98/99)
• Mathematics for Co-op (School of Engineering and Management, undergraduate studies: 99/00, 98/99)

Supervision

(Undergraduate) Diploma Theses

1. Schoof Algorithm, Jernej Barbic, August 11, 2000 (program, abstract, ps: 937KB).

2. Pseudo-Randomness in Cryptography, Tadej Novak, September 2000 (program, abstract, ps: 1.5MB).

3. RSA Cryptosystem, Robert Petek, December, 2000 (program, abstract, pdf: 553KB).

4. Mail Evidencing and Digital Signatures, Mojca Mikac, 2001. (program, abstract, ps: 1.9MB).

5. Cryptoanalysis of a Clock Controled Shift Register, Matjaz Praprotnik, 2001 (program, ps: 1.43MB).

6. Digital Cash, Miha Vuk, 2001 (program).

7. Secret sharing schemes, Vanja Senicar, 2002 (program).

8. Bases of binary finite fields, Vanja Nastran, 2003 (program).

9. Computing in finite fields with prime characteristics, Srecko Maksimovic, 2003.

10. Convolutional codes, Darjo Rejc, 2005

11. Normal bases of low complexity, Marusa Stanek, 2005.

12. Distance-regular graphs and generalized quadrangles, Matjaz Urlep, 2005.

13. Weil pairing in encryption schemes, Mitja Korce, 2006.

Master Theses

1. Management of Various Security Areas, Tomaz Degen, 2001 (program).

2. Attacks on the System and Application Infrastructure, Matej Trampus, 2001.

3. Complete system for secure exchange of data, Brane Brodnik, 2002.

4. Distance-regular graphs with small diameter, Stefko Miklavic, 2002. (program, abstract, ps: 971KB).

5. Berlekamp-Masseyev algoritem, Tadej Novak, 2003. (program, abstract, ps: 1.4MB).

6. Pollard rho method, Erik Schlegel, 2003.

7. Security of protocols, Matjaz Praprotnik.

Ph. D. Students

1. Triangle-free 1-homogeneous graphs, Stefko Miklavic, 2004.

New Research/Theses Topics