Coding theory and cryptography 2

There are no prerequisites.

The course is divided into core part, which treats the basics concepts and theoretical foundations and of coding theory and cryptography, and optional parts that include selected applications.
Core part:1. Data compression (symbol coding, Shannon's theory, Huffman coding, arithmetic coding, dictionary methods) 2. Cryptography (Basic concepts: symmetric cryptosystems, block ciphers, stream ciphers, asymmetric cryptosystems, hash functions, message authentication codes, digital signatures. Theoretical foundations: pseudorandom generators, one-way functions, their relations and uses in security analysis.) 3. Error-correcting codes (Shannon’s theorem, upper and lower bounds on the number of codewords, linear codes)

For the optional part the lecturer selects some of the following topics: selected cryptosystems, selected cryptographic protocols, efficient computation over finite fields, zero knowledge proof systems, secret sharing schemes, selected error-correcting codes (turbo codes, low density parity-check codes, Goppa codes), probabilsictic models of data

O. Goldreich, The Foundations of Cryptography - Volumes 1 and 2, Cambridge University Press.
S. Goldwasser, M. Bellare, Lecture Notes in Cryptography, available online at http://www-cse.ucsd.edu/users/mihir/papers/gb.html.
D. R. Stinson, Cryptography. Theory and practice, 3rd ed., CRC Press, 2006.
D. Welsh, Codes and cryptography, Oxford: Clarendon Press, 1995.
J. Justesen, T. Hoeholdt, A course in error-correcting codes, European Math. Soc., 2004.
Raziskovalni članki po izboru predavatelja za izbirni del predmeta

Students acquire competency to analyze communication channels with respect to security of information, reliability of transmission and computational complexity.

Knowledge and understanding: Applications of coding to achieve efficiency, security and reliability of communication. Strengths and weaknesses of symbol coding, stream coding, and dictionary methods. Comparison and applications of symmetric and asymmetric cryptosystems. Degrees of cryprographic security. Properties and use of linear codes. Good theoretical foundations in coding theory and cryptography and understanding of security analysis of cryptosystems. Knowledge of selected cryptosystems, protocols and codes in use.
Application: Data security.
Reflection: Strengths and weaknesses of different methods.
Transferable skills: Learning mathematical foundations of an applied area.

Lectures, seminar, recitation classes, coursework, consultations and independent work by the students.

Type (examination, oral, coursework, project):

Continuous assessment (homework, midterm exams, project work)
Final (written or oral exam)

Grading: 6-10 pass, 5 fail (according to the rules of University of Ljubljana)

Sergio Cabello:
CABELLO, Sergio, PADRÓ, Carles, SÁEZ, Germán. Secret sharing schemes with detection of cheaters for a general access structure. Designs, codes and cryptography, ISSN 0925-1022, 2002, vol. 25, no. 2, str. 175-188. [COBISS-SI-ID 13352281]
CABELLO, Sergio, ROTE, Günter. Obnoxious centers in graphs. SIAM journal on discrete mathematics, ISSN 0895-4801, 2010, vol. 24, no. 4, str. 1713-1730. [COBISS-SI-ID 15762265]
CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian, MARX, Dániel, ROTE, Günter. Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. ACM transactions on algorithms, ISSN 1549-6325, 2011, vol. 7, no. 4, article 43 (27 str.). [COBISS-SI-ID 16028761]
Arjana Žitnik:
JURIŠIĆ, Aleksandar, TERWILLIGER, Paul, ŽITNIK, Arjana. The Q-polynomial idempotents of a distance-regular graph. Journal of combinatorial theory. Series B, ISSN 0095-8956, 2010, vol. 100, iss. 6, str. 683-690. [COBISS-SI-ID 15688537]
KAVČIČ, Urška, MUCK, Tadeja, LOZO, Branka, ŽITNIK, Arjana. Readability of multi-colored 2D codes. Technics tehnologies education management, ISSN 1840-1503, 2011, vol. 6, no. 3, str. 622-630, ilustr. [COBISS-SI-ID 2673008]
CONDER, Marston D. E., PISANSKI, Tomaž, ŽITNIK, Arjana. GI-graphs: a new class of graphs with many symmetries. Journal of algebraic combinatorics, ISSN 0925-9899, 2014, vol. 40, iss. 1, str. 209-231. [COBISS-SI-ID 16969561]