Our laboratory focuses on cryptography and computer security. We also study coding theory and statistical design.
Most information is stored in a digital form. With the dramatic development of telecommunications and information processing the demand for information is rapidly increasing. However, with the electronic revolution, information faces new and potentially more damaging security threats. It is namely much easier to intercept and alter electronic information than its paper predecessor, and besides, attack can be delivered remotely. Information and computer security describes all measures taken to make services available and to prevent unauthorized use of electronic data, regardless whether it takes the form of disclosure, alteration and destruction of the data concerned, or verification of authenticity and data integrity, such as digital cash (carrier of value) and digital signature. Among preventive measures, cryptography provides the highest security in accordance with its flexibility for digital media. Cryptography and computer security influences cryptographic systems and applications for networks (Internet), finances (banks, stock market) and telecommunications. In particular we focus on public-key cryptosystems based on elliptic curves, algorithmic number theory, applications of finite fields and coding theory. The main mathematical background for cryptology is algebraic combinatorics (including number theory and discrete mathematics), which is being used in two other important areas of our activity: statistical design theory and coding theory. The first one provides an optimal search for sample-sets and is being used, for example, in the design of digital communications. The second one constructs data carriers known as error-correcting codes (e.g. for CDs, wireless communication, satellites), since it is too expensive and inefficient to prevent all errors and it is easier to correct them (e.g. CD with a hole of 1mm in diameter still produces a perfect sound).
Where are we?
The Laboratory for Cryptography and Computer Security is located in room R3.28 on the 3rd floor at Večna pot 113.
- Prof. Aleksandar Jurišić, PhD, Head
- as. Janoš Vidali, PhD
- as. Peter Nose
- A. Jurišić and J. H. Koolen, Distance-regular graphs with complete multipartite mu-graphs and AT4 family, Journal of Algebraic Combinatorics 25 (2007), 459 - 471.
- A. Jurišić, J. H. Koolen and Š. Miklavič, Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency, Journal Combin. Theory Ser. B 94 (2005) no. 2, 245-258.
- A. Jurišić, AT4 family and 2-homogeneous graphs, Discrete Math. 264, no. 1-3 (2003), 127-148.
- A. Jurišić and J. Koolen, 1-homogeneous graphs with Cocktail Party mu-graphs, Journal of Algebraic Combinatorics 18 (2003), 79-98.
- A. Jurišić and J. Koolen, Krein parameters and antipodal tight graphs with diameter 3 and 4, Discrete Math. 244 (2002), 181-202.
- A. Jurišić, J. H. Koolen and P. Terwilliger, Tight distance-regular graphs, Journal of Algebraic Combinatorics 12 (2000), 163 - 197.
- A. Jurišić and J. Koolen, A Local Approach to 1-Homogeneous Graphs, Designs, Codes and Cryptography 21 (2000) 127-147.
- A. Jurišić and J. Koolen, Nonexistence of some antipodal distance-regular graphs of diameter four, Europ. J. Combin. 21 (2000) 1039-1046.
- A. Jurišić, Antipodal covers of strongly regular graphs, Discrete Math. 182 (1998), 177-189.
- A. Jurišić and A. Menezes, “Elliptic Curves and Cryptography”, Dr. Dobb's Journal, April 1997, 26 - 37.
The research group maintains bilateral contact with the following institutions abroad:
- University of Waterloo, Waterloo, ONT., Canada
- Memorial University of Newfoundland, Corner Brook, NF, Canada
- Certicom Corp., Mississauga, ONT., Canada
- Telecom-Italia, Turin, Italy
- University of Wisconsin, Madison, WI, USA
- POSTECH, Pohang, S. Korea
- Osaka Kyoiku University, Osaka, Japan
- Tilburg University, Tilburg, Netherlands
- University of Ottawa, Ottawa, ONT., Canada
- Worcester Polytechnic Institute, Worcester, MA, USA
- Tohoku University Sendai, Japan
- Certification Agency with ECC, Target Research programmes (M1-0139), 2006−2008
- Elliptic Curve Cryptosystems over Prime Fields and Smart Cards, Target Research programmes (M2-0206), 2007−2009
- Database Anonymization , Basic Research and Application Project (L1-9659), 2007−2009
- Creative Path to Practical Knowledge, Structural Funds Project , 2014−2014
- , Structural Funds Project , 2015−2015