Course Information

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1/2. 5 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Matej Pivoluska, Ph.D. (seminar tutor)
Mgr. Libor Caha, PhD. (assistant)
Mgr. Luděk Matyska (assistant)
Mgr. Henrieta Micheľová (assistant)
Mgr. Roman Oravec (assistant)
Mgr. Anh Minh Tran (assistant)

Guaranteed by

prof. RNDr. Jozef Gruska, DrSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.
Supplier department: Department of Computer Science – Faculty of Informatics

Timetable

Wed 15. 9. to Wed 8. 12. Wed 10:00–11:50 D2

• Timetable of Seminar Groups:

IV054/EN: Wed 15. 9. to Wed 8. 12. Wed 14:00–15:50 B410, M. Pivoluska
IV054/SK: Wed 15. 9. to Wed 8. 12. Wed 18:00–19:50 A318, M. Pivoluska

Prerequisites

!NOW( IA174 Fundaments of Cryptography ) && ! IA174 Fundaments of Cryptography
Basics of linear algebra and o discrete mathematics, see also Appendix in http://www.fi.muni.cz/usr/gruska/crypto21

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 72 fields of study the course is directly associated with, display

Course objectives

The lecture deals with the basic methods to solve three key problems of the transmission of information - transmission, storing, hiding. All three problems are of large practical importance and their solutions are often based on elegant and deep theoretical results. To verify, for ambitious students, their capability to work hard to be successful in very competitive informatics + mathematics environment.

Learning outcomes

On successful completion of the course students should be able to: understand problems of the theory of error-correcting codes and their solutions; understand basic principles and results of the theory of secure communications; principles and problems of basic cryptosystems for encryption (both secret and public key), digital signatures and authentication; methods to create core cryptographic protocols primitives; analyze and practically use cryptosystems and such primitives as eliptic curves, hash-functions and secret-sharing methods. Basic methods for hiding information presented in steganography and watermarking. Finally, (s)he gets familiar in using quantum information processing tools and laws in general and in application to cryptography in particular. He gets also familiar with development and use cryptographic machines and with history of cryptography be experienced in methods of quantum cryptography and steganography

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptography and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory and linear codes
• Cyclic and channel codes, very modern coding methods
• Classical cryptography
• Public-key cryptosystems, knapsack, RSA, public key exchange
• Other cryptosystems and cryptographic primitives
• Digital signatures
• Elliptic curves in cryptography and integer factorization
• Basic cryptographic protocols
• Authentication, identification, secret sharing, e-commerce
• Steganography and watermarking
• From crypto-theory to crypto-practice
• Quantum cryptographic protocols
• Machines and history of cryptography

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Teaching methods

Lectures, in English Tutorials: one in English, one in Czech/Slovak Homeworks. 5-6 sets of 6-8 exercises chosen and evaluated by members of CRYPTO_team composed mostly of some of best students of previous IV054 lectures.

Assessment methods

Oral exam. Each student will get 5 questions. Number of question a student has to respond will depend on the number of points received for homeworks. Each student will get automatically A in case (s)he received number of points from exercises <= 85% of MAX - maximal number of points a studen got from exercises. Automatically a student gets B, with an easy way to get A, in case the number of points received is in interval (75,85)% og Max. a ....

Language of instruction

English

Further comments (probably available only in Czech)

Study Materials
The course is taught last offered.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto19
Teaching materials: 1. Detailed slides of all lectures. Each chapter will consists of a (i) short Prologue, (ii) basic materials and an (iii) Appendix - for much demanding students 2. Appendix of fundamental discrete math and linear algebra - 45 pages 3. Two lecture notes of solved examples (at least 1000 in each one) 4. Posted solutions of homeworks.

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1/2. 5 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Matej Pivoluska, Ph.D. (seminar tutor)
Mgr. Libor Caha, PhD. (assistant)
Mgr. Luděk Matyska (assistant)
Mgr. Henrieta Micheľová (assistant)
Mgr. Anh Minh Tran (assistant)

Guaranteed by

prof. RNDr. Jozef Gruska, DrSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.
Supplier department: Department of Computer Science – Faculty of Informatics

Timetable

Wed 10:00–11:50 Virtuální místnost

• Timetable of Seminar Groups:

IV054/01: Thu 10:00–11:50 A217, M. Pivoluska
IV054/02: Thu 8:00–9:50 A217, M. Pivoluska

Prerequisites

Basics of linear algebra and of the theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 72 fields of study the course is directly associated with, display

Course objectives

The lecture deals with the basic methods to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results.

Learning outcomes

On successful completion of the course students should be able to: understand problems of the theory of error-correcting codes; understand basic principles and results of the theory of secure communication; know principles and problems of basic cryptosystems for encryption (both secret and public key), digital signing and authentication; know methods to create core cryptographic protocols primitives; analyze and practically use simple cryptosystems; be experienced in methods of quantum cryptography and steganography

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptography and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic and channel codes
• Classical cryptography
• Public-key cryptosystems, knapsack, RSA, public key exchange
• Other cryptosystems and cryptographic primitives
• Digital signatures
• Elliptic curves in cryptography and integer factorization
• Basic cryptographic protocols
• Authentication, identification, secret sharing, e-commerce
• Steganography and watermarking
• From crypto-theory to crypto-practice
• Quantum cryptographic protocols
• Machines and history of cryptography

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Teaching methods

Lectures and homework

Assessment methods

Oral exam.

Language of instruction

English

Further comments (probably available only in Czech)

Study Materials
The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto19

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1/2. 5 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Matej Pivoluska, Ph.D. (seminar tutor)
Mgr. Libor Caha, PhD. (assistant)
Mgr. Luděk Matyska (assistant)
Mgr. Anh Minh Tran (assistant)

Guaranteed by

prof. RNDr. Jozef Gruska, DrSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.
Supplier department: Department of Computer Science – Faculty of Informatics

Timetable

Wed 10:00–11:50 D2

• Timetable of Seminar Groups:

IV054/01: Thu 16:00–17:50 B204, M. Pivoluska
IV054/02: Thu 10:00–11:50 A217, M. Pivoluska

Prerequisites

Basics of linear algebra and of the theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 72 fields of study the course is directly associated with, display

Course objectives

The lecture deals with the basic methods to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results.

Learning outcomes

On successful completion of the course students should be able to: understand problems of the theory of error-correcting codes; understand basic principles and results of the theory of secure communication; know principles and problems of basic cryptosystems for encryption (both secret and public key), digital signing and authentication; know methods to create core cryptographic protocols primitives; analyze and practically use simple cryptosystems; be experienced in methods of quantum cryptography and steganography

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptography and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic and channel codes
• Classical cryptography
• Public-key cryptosystems, knapsack, RSA, public key exchange
• Other cryptosystems and cryptographic primitives
• Digital signatures
• Elliptic curves in cryptography and integer factorization
• Basic cryptographic protocols
• Authentication, identification, secret sharing, e-commerce
• Steganography and watermarking
• From crypto-theory to crypto-practice
• Quantum cryptographic protocols
• Machines and history of cryptography

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Teaching methods

Lectures and homework

Assessment methods

Oral exam.

Language of instruction

English

Further comments (probably available only in Czech)

Study Materials
The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto19

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1/2. 5 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Matej Pivoluska, Ph.D. (seminar tutor)
Mgr. Luděk Matyska (seminar tutor)
Mgr. Libor Caha, PhD. (assistant)
Mgr. Martin Frian (assistant)
Mgr. Ondřej Krčma (assistant)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.
Supplier department: Department of Computer Science – Faculty of Informatics

Timetable

Wed 10:00–11:50 D2

• Timetable of Seminar Groups:

IV054/01: Wed 14:00–15:50 A319, M. Pivoluska
IV054/02: Wed 16:00–17:50 A319, M. Pivoluska

Prerequisites

Basics of linear algebra and of theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 40 fields of study the course is directly associated with, display

Course objectives

Lecture deals with the basic methods to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results. On successful completion of the course students should be able to: understand problems of the theory of error-correcting codes; understand basic principles and results of the theory of secure communication; know principles and problems of basic cryptosystems for encryption (both secret and public key), digital signing and authentication; know methods to create core cryptographic protocols primitives; analyze and practically use simple cryptosystems; be experienced in methods of quantum cryptography and steganography

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptohraphy and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic and channel codes
• Classical cryptography
• Public-key cryptosystems, knaosack, RSA, public key exchange
• Other cryptosystems and cryptographic primitives
• Digital signatures
• Eliptic curves cryptography and integer factorization
• Basic cryptographic protocols
• Authentication, identification, secret sharing, e-commerce
• Steganography and watermarking
• From crypto-theory to crypto-practice
• Quantum cryptographic protocols
• Machines and history of cryptography

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Teaching methods

Lectures and homeworks

Assessment methods

oral exam

Language of instruction

English

Further comments (probably available only in Czech)

The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

https://www.fi.muni.cz/usr/gruska/crypto18/

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1/2. 5 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Matej Pivoluska, Ph.D. (seminar tutor)
Mgr. Luděk Matyska (seminar tutor)
RNDr. Vladimír Sedláček, Ph.D. (assistant)
Mgr. Marek Vančík (assistant)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.
Supplier department: Department of Computer Science – Faculty of Informatics

Timetable

Wed 10:00–11:50 D2

• Timetable of Seminar Groups:

IV054/01: Wed 16:00–17:50 B410, M. Pivoluska
IV054/02: Wed 18:00–19:50 B410, M. Pivoluska

Prerequisites

Basics of linear algebra and of theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 40 fields of study the course is directly associated with, display

Course objectives

Lecture deals with the basic methods to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results. On successful completion of the course students should be able to: understand problems of the theory of error-correcting codes; understand basic principles and results of the theory of secure communication; know principles and problems of basic cryptosystems for encryption (both secret and public key), digital signing and authentication; know methods to create core cryptographic protocols primitives; analyze and practically use simple cryptosystems; be experienced in methods of quantum cryptography and steganography

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptohraphy and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic and channel codes
• Classical cryptography
• Public-key cryptosystems, knaosack, RSA, public key exchange
• Other cryptosystems and cryptographic primitives
• Digital signatures
• Eliptic curves cryptography and integer factorization
• Basic cryptographic protocols
• Authentication, identification, secret sharing, e-commerce
• Steganography and watermarking
• From crypto-theory to crypto-practice
• Quantum cryptographic protocols
• Machines and history of cryptography

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Teaching methods

Lectures and homeworks

Assessment methods

oral exam

Language of instruction

English

Further comments (probably available only in Czech)

Study Materials
The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto16

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1/2. 5 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Matej Pivoluska, Ph.D. (assistant)
RNDr. Michal Ajdarów (seminar tutor)
Mgr. Luděk Matyska (seminar tutor)
RNDr. Adam Janovský (assistant)
Mgr. Marek Vančík (assistant)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.
Supplier department: Department of Computer Science – Faculty of Informatics

Timetable

Wed 10:00–11:50 D2

• Timetable of Seminar Groups:

IV054/T01: Wed 21. 9. to Wed 21. 12. Wed 13:00–14:45 110, L. Matyska, Nepřihlašuje se. Určeno pro studenty se zdravotním postižením.
IV054/01: Wed 18:00–19:50 B204, M. Ajdarów
IV054/02: Wed 16:00–17:50 B204, L. Matyska

Prerequisites

Basics of linear algebra and of theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 40 fields of study the course is directly associated with, display

Course objectives

Lecture deals with the basic methods to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results. On successful completion of the course students should be able to: understand problems of the theory of error-correcting codes; understand basic principles and results of the theory of secure communication; know principles and problems of basic cryptosystems for encryption (both secret and public key), digital signing and authentication; know methods to create core cryptographic protocols primitives; analyze and practically use simple cryptosystems; be experienced in methods of quantum cryptography and steganography

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptohraphy and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic and channel codes
• Classical cryptography
• Public-key cryptosystems, knaosack, RSA, public key exchange
• Other cryptosystems and cryptographic primitives
• Digital signatures
• Eliptic curves cryptography and integer factorization
• Basic cryptographic protocols
• Authentication, identification, secret sharing, e-commerce
• Steganography and watermarking
• From crypto-theory to crypto-practice
• Quantum cryptographic protocols
• Machines and history of cryptography

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Teaching methods

Lectures and homeworks

Assessment methods

oral exam

Language of instruction

English

Further comments (probably available only in Czech)

Study Materials
The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto16

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1/2. 5 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Ivan Fialík, Ph.D. (seminar tutor)
RNDr. Matej Pivoluska, Ph.D. (assistant)
Shenggen Zheng, PhD (assistant)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.
Supplier department: Department of Computer Science – Faculty of Informatics

Timetable

Wed 10:00–11:50 D2

• Timetable of Seminar Groups:

IV054/01: Wed 16:00–17:50 A217, M. Pivoluska
IV054/02: Thu 18:00–19:50 A318, M. Pivoluska

Prerequisites

Basics of linear algebra and of theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 40 fields of study the course is directly associated with, display

Course objectives

Lecture deals with the basic methods to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results. On successful completion of the course students should be able to: understand problems of the theory of error-correcting codes; understand basic principles and results of the theory of secure communication; know principles and problems of basic cryptosystems for encryption (both secret and public key), digital signing and authentication; know methods to create core cryptographic protocols primitives; analyze and practically use simple cryptosystems; be experienced in methods of quantum cryptography and steganography

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptohraphy and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic and channel codes
• Classical cryptography
• Public-key cryptosystems, knaosack, RSA, public key exchange
• Other cryptosystems and cryptographic primitives
• Digital signatures
• Eliptic curves cryptography and integer factorization
• Basic cryptographic protocols
• Authentication, identification, secret sharing, e-commerce
• Steganography and watermarking
• From crypto-theory to crypto-practice
• Quantum cryptographic protocols
• Machines and history of cryptography

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Teaching methods

Lectures and homeworks

Assessment methods

oral exam

Language of instruction

English

Further comments (probably available only in Czech)

Study Materials
The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto14

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1/2. 5 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Ivan Fialík, Ph.D. (seminar tutor)
RNDr. Matej Pivoluska, Ph.D. (assistant)
Shenggen Zheng, PhD (assistant)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.
Supplier department: Department of Computer Science – Faculty of Informatics

Timetable

Wed 10:00–11:50 D2

• Timetable of Seminar Groups:

IV054/01: Wed 18:00–19:50 A218, S. Zheng
IV054/02: Thu 16:00–17:50 C525, M. Pivoluska

Prerequisites

Basics of linear algebra and of theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 39 fields of study the course is directly associated with, display

Course objectives

Lecture deals with the basic methods to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results. On successful completion of the course students should be able to: understand problems of the theory of error-correcting codes; understand basic principles and results of the theory of secure communication; know principles and problems of basic cryptosystems for encryption (both secret and public key), digital signing and authentication; know methods to create core cryptographic protocols primitives; analyze and practically use simple cryptosystems; be experienced in methods of quantum cryptography and steganography

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptohraphy and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic and channel codes
• Classical cryptography
• Public-key cryptosystems, knaosack, RSA, public key exchange
• Other cryptosystems and cryptographic primitives
• Digital signatures
• Eliptic curves cryptography and integer factorization
• Basic cryptographic protocols
• Authentication, identification, secret sharing, e-commerce
• Steganography and watermarking
• From crypto-theory to crypto-practice
• Quantum cryptographic protocols
• Machines and history of cryptography

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Teaching methods

Lectures and homeworks

Assessment methods

oral exam

Language of instruction

Slovak

Further comments (probably available only in Czech)

Study Materials
The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto14

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1/2. 5 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Ivan Fialík, Ph.D. (seminar tutor)
RNDr. Matej Pivoluska, Ph.D. (assistant)
Shenggen Zheng, PhD (assistant)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.
Supplier department: Department of Computer Science – Faculty of Informatics

Timetable

Wed 10:00–11:50 D2

Prerequisites

Basics of linear algebra and of theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 39 fields of study the course is directly associated with, display

Course objectives

Lecture deals with the basic methods to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results. On successful completion of the course students should be able to: understand problems of the theory of error-correcting codes; understand basic principles and results of the theory of secure communication; know principles and problems of basic cryptosystems for encryption (both secret and public key), digital signing and authentication; know methods to create core cryptographic protocols primitives; analyze and practically use simple cryptosystems; be experienced in methods of quantum cryptography and steganography

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptohraphy and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic codes
• Classical cryptography
• Public-key cryptosystems
• RSA cryptosystems and digital signatures
• Integer factorization and prime recognition
• Other cryptosystems
• Basic cryptographic protocols
• Zero-knowledge protocols
• Steganography
• From crypto-theory ro crypto-practice
• Quantum key distribution
• Quantum cryptographic protocols

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Teaching methods

Lectures and homeworks

Assessment methods

oral exam

Language of instruction

Slovak

Further comments (probably available only in Czech)

Study Materials
The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto13

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1/2. 5 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
doc. RNDr. Jan Bouda, Ph.D. (seminar tutor)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Ivan Fialík, Ph.D. (seminar tutor)
Mgr. Libor Caha, PhD. (assistant)
RNDr. Matej Pivoluska, Ph.D. (assistant)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.
Supplier department: Department of Computer Science – Faculty of Informatics

Timetable

Wed 10:00–11:50 D2

Prerequisites

Basics of linear algebra and of theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 41 fields of study the course is directly associated with, display

Course objectives

Lecture deals with the basic methods to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results. On successful completion of the course students should be able to: understand problems of the theory of error-correcting codes; understand basic principles and results of the theory of secure communication; know principles and problems of basic cryptosystems for encryption (both secret and public key), digital signing and authentication; know methods to create core cryptographic protocols primitives; analyze and practically use simple cryptosystems; be experienced in methods of quantum cryptography and steganography

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptohraphy and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic codes
• Classical cryptography
• Public-key cryptosystems
• RSA cryptosystems and digital signatures
• Integer factorization and prime recognition
• Other cryptosystems
• Basic cryptographic protocols
• Zero-knowledge protocols
• Steganography
• From crypto-theory ro crypto-practice
• Quantum key distribution
• Quantum cryptographic protocols

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Teaching methods

Lectures and homeworks

Assessment methods

oral exam

Language of instruction

Slovak

Further comments (probably available only in Czech)

Study Materials
The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto12

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1/2. 5 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
doc. RNDr. Jan Bouda, Ph.D. (seminar tutor)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Ivan Fialík, Ph.D. (seminar tutor)
Mgr. Libor Caha, PhD. (assistant)
RNDr. Matej Pivoluska, Ph.D. (assistant)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.

Timetable

Wed 10:00–11:50 D3

Prerequisites

Basics of linear algebra and of theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 41 fields of study the course is directly associated with, display

Course objectives

Lecture deals with the basic methods to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results. On successful completion of the course students should be able to: understand problems of the theory of error-correcting codes; understand basic principles and results of the theory of secure communication; know principles and problems of basic cryptosystems for encryption (both secret and public key), digital signing and authentication; know methods to create core cryptographic protocols primitives; analyze and practically use simple cryptosystems; be experienced in methods of quantum cryptography and steganography

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptohraphy and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic codes
• Classical cryptography
• Public-key cryptosystems
• RSA cryptosystems and digital signatures
• Integer factorization and prime recognition
• Other cryptosystems
• Basic cryptographic protocols
• Zero-knowledge protocols
• Steganography
• From crypto-theory ro crypto-practice
• Quantum key distribution
• Quantum cryptographic protocols

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Teaching methods

Lectures and homeworks

Assessment methods

oral exam

Language of instruction

Slovak

Further comments (probably available only in Czech)

Study Materials
The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto11/

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
doc. RNDr. Jan Bouda, Ph.D. (seminar tutor)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Ivan Fialík, Ph.D. (seminar tutor)
Mgr. Libor Caha, PhD. (assistant)
RNDr. Matej Pivoluska, Ph.D. (assistant)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.

Timetable

Wed 10:00–11:50 D3

Prerequisites

Basics of linear algebra and of theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 40 fields of study the course is directly associated with, display

Course objectives

Lecture deals with the basic methods to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results. On successful completion of the course students should be able to: understand problems of the theory of error-correcting codes; understand basic principles and results of the theory of secure communication; know principles and problems of basic cryptosystems for encryption (both secret and public key), digital signing and authentication; know methods to create core cryptographic protocols primitives; analyze and practically use simple cryptosystems; be experienced in methods of quantum cryptography and steganography

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptohraphy and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic codes
• Classical cryptography
• Public-key cryptosystems
• RSA cryptosystems and digital signatures
• Integer factorization and prime recognition
• Other cryptosystems
• Basic cryptographic protocols
• Zero-knowledge protocols
• Steganography
• From crypto-theory ro crypto-practice
• Quantum key distribution
• Quantum cryptographic protocols

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Teaching methods

Lectures and homeworks

Assessment methods

oral exam

Language of instruction

Slovak

Further comments (probably available only in Czech)

Study Materials
The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto09/

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
doc. RNDr. Jan Bouda, Ph.D. (seminar tutor)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Ivan Fialík, Ph.D. (seminar tutor)
RNDr. Josef Šprojcar, Ph.D. (seminar tutor)
Mgr. Zbyněk Konečný (assistant)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.

Timetable

Wed 10:00–11:50 D2

Prerequisites

Basics of linear algebra and of theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 44 fields of study the course is directly associated with, display

Course objectives

Lecture deals with the basic methods to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results. On successful completion of the course students should be able to: understand problems of the theory of error-correcting codes; understand basic principles and results of the theory of secure communication; know principles and problems of basic cryptosystems for encryption (both secret and public key), digital signing and authentication; know methods to create core cryptographic protocols primitives; analyze and practically use simple cryptosystems; be experienced in methods of quantum cryptography and steganography

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptohraphy and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic codes
• Classical cryptography
• Public-key cryptosystems
• RSA cryptosystems and digital signatures
• Integer factorization and prime recognition
• Other cryptosystems
• Basic cryptographic protocols
• Zero-knowledge protocols
• Steganography
• From crypto-theory ro crypto-practice
• Quantum key distribution
• Quantum cryptographic protocols

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Teaching methods

Lectures and homeworks

Assessment methods

oral exam

Language of instruction

Slovak

Further comments (probably available only in Czech)

Study Materials
The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto09/

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
doc. RNDr. Jan Bouda, Ph.D. (seminar tutor)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Ivan Fialík, Ph.D. (seminar tutor)
RNDr. Josef Šprojcar, Ph.D. (seminar tutor)
Mgr. Zbyněk Konečný (assistant)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.

Timetable

Wed 10:00–11:50 D2

Prerequisites

Basics of linear algebra and of theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 37 fields of study the course is directly associated with, display

Course objectives

Lecture deals with the basic methods how to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results. The first problem is how to make secure transmission of information through a noisy channel. Error-correcting codes are the main toolsfor doing that and they are dealt with in the first three lectures. Theory of error-coreecting codes is one of the most applied parts of algebra. Second problem is how to achieve that transmitted information does not get into un-authorized parties. Cryptography deals with this problem by developing various encryption and decryption methods. Related problems are that of the development of systems for secure digital signatures and cryptographic protocols that allow to perform several secure communication or cooperation tasks among various parties. Methods of classical and quantum cryptography will be introduced. Third problem is how to hide information to be transmitted in some other innoncently looking information. This task is of growing importance for a variety of reasons and a protection of intelectual properties is one of them. Basic techniques of steganography will be presented.

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptohraphy and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic codes
• Classical cryptography
• Public-key cryptosystems
• RSA cryptosystems and digital signatures
• Integer factorization and prime recognition
• Other cryptosystems
• Basic cryptographic protocols
• Zero-knowledge protocols
• Steganography
• From crypto-theory ro crypto-practice
• Quantum key distribution
• Quantum cryptographic protocols

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Assessment methods

oral exam

Language of instruction

Slovak

Further comments (probably available only in Czech)

Study Materials
The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto04/

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
doc. RNDr. Jan Bouda, Ph.D. (seminar tutor)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Josef Šprojcar, Ph.D. (seminar tutor)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.

Timetable

Wed 10:00–11:50 D2

Prerequisites

Basics of linear algebra and of theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 37 fields of study the course is directly associated with, display

Course objectives

Lecture deals with the basic methods how to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results. The first problem is how to make secure transmission of information through a noisy channel. Error-correcting codes are the main toolsfor doing that and they are dealt with in the first three lectures. Theory of error-coreecting codes is one of the most applied parts of algebra. Second problem is how to achieve that transmitted information does not get into un-authorized parties. Cryptography deals with this problem by developing various encryption and decryption methods. Related problems are that of the development of systems for secure digital signatures and cryptographic protocols that allow to perform several secure communication or cooperation tasks among various parties. Methods of classical and quantum cryptography will be introduced. Third problem is how to hide information to be transmitted in some other innoncently looking information. This task is of growing importance for a variety of reasons and a protection of intelectual properties is one of them. Basic techniques of steganography will be presented.

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptohraphy and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic codes
• Classical cryptography
• Public-key cryptosystems
• RSA cryptosystems and digital signatures
• Integer factorization and prime recognition
• Other cryptosystems
• Basic cryptographic protocols
• Zero-knowledge protocols
• Steganography
• From crypto-theory ro crypto-practice
• Quantum key distribution
• Quantum cryptographic protocols

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Assessment methods (in Czech)

Zkouska probiha ustne v cestine, slovenstine nebo anglictine podle vyberu studenta. Zadani zkousky je v anglictine.

Language of instruction

Slovak

Further comments (probably available only in Czech)

Study Materials
The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto04/

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
doc. RNDr. Jan Bouda, Ph.D. (seminar tutor)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Josef Šprojcar, Ph.D. (seminar tutor)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.

Timetable

Wed 10:00–11:50 D3

Prerequisites

! I054 Cryptography and C.Protocols
Basics of linear algebra and of theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 17 fields of study the course is directly associated with, display

Course objectives

Lecture deals with the basic methods how to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results. The first problem is how to make secure transmission of information through a noisy channel. Error-correcting codes are the main toolsfor doing that and they are dealt with in the first three lectures. Theory of error-coreecting codes is one of the most applied parts of algebra. Second problem is how to achieve that transmitted information does not get into un-authorized parties. Cryptography deals with this problem by developing various encryption and decryption methods. Related problems are that of the development of systems for secure digital signatures and cryptographic protocols that allow to perform several secure communication or cooperation tasks among various parties. Methods of classical and quantum cryptography will be introduced. Third problem is how to hide information to be transmitted in some other innoncently looking information. This task is of growing importance for a variety of reasons and a protection of intelectual properties is one of them. Basic techniques of steganography will be presented.

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptohraphy and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic codes
• Classical cryptography
• Public-key cryptosystems
• RSA cryptosystems and digital signatures
• Integer factorization and prime recognition
• Other cryptosystems
• Basic cryptographic protocols
• Zero-knowledge protocols
• Steganography
• From crypto-theory ro crypto-practice
• Quantum key distribution
• Quantum cryptographic protocols

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Assessment methods (in Czech)

Zkouska probiha ustne v cestine, slovenstine nebo anglictine podle vyberu studenta. Zadani zkousky je v anglictine.

Language of instruction

Slovak

Further comments (probably available only in Czech)

Study Materials
The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto04/

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
doc. RNDr. Jan Bouda, Ph.D. (seminar tutor)
RNDr. Josef Šprojcar, Ph.D. (seminar tutor)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.

Timetable

Wed 10:00–11:50 D2

Prerequisites

! I054 Cryptography and C.Protocols
Basics of linear algebra and of theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 17 fields of study the course is directly associated with, display

Course objectives

Lecture deals with the basic methods how to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results. The first problem is how to make secure transmission of information through a noisy channel. Error-correcting codes are the main toolsfor doing that and they are dealt with in the first three lectures. Theory of error-coreecting codes is one of the most applied parts of algebra. Second problem is how to achieve that transmitted information does not get into un-authorized parties. Cryptography deals with this problem by developing various encryption and decryption methods. Related problems are that of the development of systems for secure digital signatures and cryptographic protocols that allow to perform several secure communication or cooperation tasks among various parties. Methods of classical and quantum cryptography will be introduced. Third problem is how to hide information to be transmitted in some other innoncently looking information. This task is of growing importance for a variety of reasons and a protection of intelectual properties is one of them. Basic techniques of steganography will be presented.

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptohraphy and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic codes
• Classical cryptography
• Public-key cryptosystems
• RSA cryptosystems and digital signatures
• Integer factorization and prime recognition
• Other cryptosystems
• Basic cryptographic protocols
• Zero-knowledge protocols
• Steganography
• From crypto-theory ro crypto-practice
• Quantum key distribution
• Quantum cryptographic protocols

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Assessment methods (in Czech)

Zkouska probiha ustne v cestine, slovenstine nebo anglictine podle vyberu studenta. Zadani zkousky je v anglictine.

Language of instruction

Slovak

Further comments (probably available only in Czech)

The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto04/

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
doc. RNDr. Jan Bouda, Ph.D. (seminar tutor)
RNDr. Hynek Mlnařík, Ph.D. (seminar tutor)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.

Timetable

Wed 10:00–11:50 D2

Prerequisites

! I054 Cryptography and C.Protocols
Basics of linear algebra and of theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 17 fields of study the course is directly associated with, display

Course objectives

Lecture deals with the basic methods how to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results. The first problem is how to make secure transmission of information through a noisy channel. Error-correcting codes are the main toolsfor doing that and they are dealt with in the first three lectures. Theory of error-coreecting codes is one of the most applied parts of algebra. Second problem is how to achieve that transmitted information does not get into un-authorized parties. Cryptography deals with this problem by developing various encryption and decryption methods. Related problems are that of the development of systems for secure digital signatures and cryptographic protocols that allow to perform several secure communication or cooperation tasks among various parties. Methods of classical and quantum cryptography will be introduced. Third problem is how to hide information to be transmitted in some other innoncently looking information. This task is of growing importance for a variety of reasons and a protection of intelectual properties is one of them. Basic techniques of steganography will be presented.

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptohraphy and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic codes
• Classical cryptography
• Public-key cryptosystems
• RSA cryptosystems and digital signatures
• Integer factorization and prime recognition
• Other cryptosystems
• Basic cryptographic protocols
• Zero-knowledge protocols
• Steganography
• From crypto-theory ro crypto-practice
• Quantum key distribution
• Quantum cryptographic protocols

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Assessment methods (in Czech)

Zkouska probiha ustne v cestine, slovenstine nebo anglictine podle vyberu studenta. Zadani zkousky je v anglictine.

Language of instruction

Slovak

Further comments (probably available only in Czech)

The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto04/

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
doc. RNDr. Jan Bouda, Ph.D. (seminar tutor)
prof. Dr. phil. Jakub Mácha, Ph.D. (seminar tutor)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.

Timetable

Wed 10:00–11:50 A107

Prerequisites (in Czech)

! I054 Cryptography and C.Protocols && ( MB008 Algebra I || M008 Algebra I ) && ( MB003 Linear Algebra and Geometry I || MB102 Mathematics II || M003 Linear Algebra and Geometry I )

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

• Informatics (programme FI, B-IN)
• Informatics (programme FI, M-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)

Course objectives

Lecture deals with the basic methods how to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results. The first problem is how to make secure transmission of information through a noisy channel. Error-correcting codes are the main toolsfor doing that and they are dealt with in the first three lectures. Theory of error-coreecting codes is one of the most applied parts of algebra. Second problem is how to achieve that transmitted information does not get into un-authorized parties. Cryptography deals with this problem by developing various encryption and decryption methods. Related problems are that of the development of systems for secure digital signatures and cryptographic protocols that allow to perform several secure communication or cooperation tasks among various parties. Methods of classical and quantum cryptography will be introduced. Third problem is how to hide information to be transmitted in some other innoncently looking information. This task is of growing importance for a variety of reasons and a protection of intelectual properties is one of them. Basic techniques of steganography will be presented.

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptohraphy and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic codes
• Classical cryptography
• Public-key cryptosystems
• RSA cryptosystems and digital signatures
• Integer factorization and prime recognition
• Other cryptosystems
• Basic cryptographic protocols
• Zero-knowledge protocols
• Steganography
• From crypto-theory ro crypto-practice
• Quantum key distribution
• Quantum cryptographic protocols

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Assessment methods (in Czech)

Zkouska probiha ustne v cestine, slovenstine nebo anglictine podle vyberu studenta. Zadani zkousky je v anglictine.

Language of instruction

Slovak

Further comments (probably available only in Czech)

The course is taught annually.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

IV054 Coding, Cryptography and Cryptographic Protocols

Extent and Intensity

2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
doc. RNDr. Jan Bouda, Ph.D. (seminar tutor)
prof. Dr. phil. Jakub Mácha, Ph.D. (seminar tutor)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.

Timetable

Wed 10:00–11:50 D1

Prerequisites (in Czech)

! I054 Cryptography and C.Protocols && ( MB005 Foundations of mathematics || MB101 Foundations of mathematics I || M005 Foundations of mathematics ) && ( MB003 Linear Algebra and Geometry I || MB102 Mathematics II || M003 Linear Algebra and Geometry I )

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

• Informatics (programme FI, B-IN)
• Informatics (programme FI, M-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)

Course objectives

Lecture deals with the basic methods how to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results. The first problem is how to make secure transmission of information through a noisy channel. Error-correcting codes are the main toolsfor doing that and they are dealt with in the first three lectures. Theory of error-coreecting codes is one of the most applied parts of algebra. Second problem is how to achieve that transmitted information does not get into un-authorized parties. Cryptography deals with this problem by developing various encryption and decryption methods. Related problems are that of the development of systems for secure digital signatures and cryptographic protocols that allow to perform several secure communication or cooperation tasks among various parties. Methods of classical and quantum cryptography will be introduced. Third problem is how to hide information to be transmitted in some other innoncently looking information. This task is of growing importance for a variety of reasons and a protection of intelectual properties is one of them. Basic techniques of steganography will be presented.

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptohraphy and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic codes
• Classical cryptography
• Public-key cryptosystems
• RSA cryptosystems and digital signatures
• Integer factorization and prime recognition
• Other cryptosystems
• Basic cryptographic protocols
• Zero-knowledge protocols
• Steganography
• From crypto-theory ro crypto-practice
• Quantum key distribution
• Quantum cryptographic protocols

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Assessment methods (in Czech)

Zkouska probiha ustne v cestine, slovenstine nebo anglictine podle vyberu studenta. Zadani zkousky je v anglictine.

Language of instruction

Slovak

Further Comments

The course is taught annually.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

IV054 Coding, Cryptography and Cryptographic Protocols

The course is not taught in Autumn 2023

Extent and Intensity

2/1/2. 5 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Matej Pivoluska, Ph.D. (seminar tutor)
Mgr. Libor Caha, PhD. (assistant)
Mgr. Luděk Matyska (assistant)
Mgr. Henrieta Micheľová (assistant)
Mgr. Roman Oravec (assistant)
Mgr. Anh Minh Tran (assistant)

Guaranteed by

prof. RNDr. Jozef Gruska, DrSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.
Supplier department: Department of Computer Science – Faculty of Informatics

Prerequisites

!NOW( IA174 Fundaments of Cryptography ) && ! IA174 Fundaments of Cryptography
Basics of linear algebra and o discrete mathematics, see also Appendix in http://www.fi.muni.cz/usr/gruska/crypto21

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 72 fields of study the course is directly associated with, display

Course objectives

The lecture deals with the basic methods to solve three key problems of the transmission of information - transmission, storing, hiding. All three problems are of large practical importance and their solutions are often based on elegant and deep theoretical results. To verify, for ambitious students, their capability to work hard to be successful in very competitive informatics + mathematics environment.

Learning outcomes

On successful completion of the course students should be able to: understand problems of the theory of error-correcting codes and their solutions; understand basic principles and results of the theory of secure communications; principles and problems of basic cryptosystems for encryption (both secret and public key), digital signatures and authentication; methods to create core cryptographic protocols primitives; analyze and practically use cryptosystems and such primitives as eliptic curves, hash-functions and secret-sharing methods. Basic methods for hiding information presented in steganography and watermarking. Finally, (s)he gets familiar in using quantum information processing tools and laws in general and in application to cryptography in particular. He gets also familiar with development and use cryptographic machines and with history of cryptography be experienced in methods of quantum cryptography and steganography

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptography and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory and linear codes
• Cyclic and channel codes, very modern coding methods
• Classical cryptography
• Public-key cryptosystems, knapsack, RSA, public key exchange
• Other cryptosystems and cryptographic primitives
• Digital signatures
• Elliptic curves in cryptography and integer factorization
• Basic cryptographic protocols
• Authentication, identification, secret sharing, e-commerce
• Steganography and watermarking
• From crypto-theory to crypto-practice
• Quantum cryptographic protocols
• Machines and history of cryptography

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Teaching methods

Lectures, in English Tutorials: one in English, one in Czech/Slovak Homeworks. 5-6 sets of 6-8 exercises chosen and evaluated by members of CRYPTO_team composed mostly of some of best students of previous IV054 lectures.

Assessment methods

Oral exam. Each student will get 5 questions. Number of question a student has to respond will depend on the number of points received for homeworks. Each student will get automatically A in case (s)he received number of points from exercises <= 85% of MAX - maximal number of points a studen got from exercises. Automatically a student gets B, with an easy way to get A, in case the number of points received is in interval (75,85)% og Max. a ....

Language of instruction

English

Further comments (probably available only in Czech)

Course is no more offered.
The course is taught: every week.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto19
Teaching materials: 1. Detailed slides of all lectures. Each chapter will consists of a (i) short Prologue, (ii) basic materials and an (iii) Appendix - for much demanding students 2. Appendix of fundamental discrete math and linear algebra - 45 pages 3. Two lecture notes of solved examples (at least 1000 in each one) 4. Posted solutions of homeworks.

IV054 Coding, Cryptography and Cryptographic Protocols

The course is not taught in Spring 2023

Extent and Intensity

2/1/2. 5 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Matej Pivoluska, Ph.D. (seminar tutor)
Mgr. Luděk Matyska (assistant)
Mgr. Henrieta Micheľová (assistant)
Mgr. Anh Minh Tran (assistant)

Guaranteed by

prof. RNDr. Jozef Gruska, DrSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.
Supplier department: Department of Computer Science – Faculty of Informatics

Prerequisites

IA174 Fundaments of Cryptography && IA066 Quantum Computing - an intro
Basics of linear algebra and of the theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 73 fields of study the course is directly associated with, display

Course objectives

The lecture deals with the basic methods to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results.

Learning outcomes

On successful completion of the course students should be able to: understand problems of the theory of error-correcting codes; understand basic principles and results of the theory of secure communication; know principles and problems of basic cryptosystems for encryption (both secret and public key), digital signing and authentication; know methods to create core cryptographic protocols primitives; analyze and practically use simple cryptosystems; be experienced in methods of quantum cryptography and steganography

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptography and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic and channel codes
• Classical cryptography
• Public-key cryptosystems, knapsack, RSA, public key exchange
• Other cryptosystems and cryptographic primitives
• Digital signatures
• Elliptic curves in cryptography and integer factorization
• Basic cryptographic protocols
• Authentication, identification, secret sharing, e-commerce
• Steganography and watermarking
• From crypto-theory to crypto-practice
• Quantum cryptographic protocols
• Machines and history of cryptography

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Teaching methods

Lectures and homework

Assessment methods

Oral exam.

Language of instruction

English

Further comments (probably available only in Czech)

The course is taught annually.
The course is taught: every week.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto19

IV054 Coding, Cryptography and Cryptographic Protocols

The course is not taught in Autumn 2022

Extent and Intensity

2/1/2. 5 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Matej Pivoluska, Ph.D. (seminar tutor)
Mgr. Libor Caha, PhD. (assistant)
Mgr. Luděk Matyska (assistant)
Mgr. Henrieta Micheľová (assistant)
Mgr. Roman Oravec (assistant)
Mgr. Anh Minh Tran (assistant)

Guaranteed by

prof. RNDr. Jozef Gruska, DrSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.
Supplier department: Department of Computer Science – Faculty of Informatics

Prerequisites

!NOW( IA174 Fundaments of Cryptography ) && ! IA174 Fundaments of Cryptography
Basics of linear algebra and o discrete mathematics, see also Appendix in http://www.fi.muni.cz/usr/gruska/crypto21

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 72 fields of study the course is directly associated with, display

Course objectives

The lecture deals with the basic methods to solve three key problems of the transmission of information - transmission, storing, hiding. All three problems are of large practical importance and their solutions are often based on elegant and deep theoretical results. To verify, for ambitious students, their capability to work hard to be successful in very competitive informatics + mathematics environment.

Learning outcomes

On successful completion of the course students should be able to: understand problems of the theory of error-correcting codes and their solutions; understand basic principles and results of the theory of secure communications; principles and problems of basic cryptosystems for encryption (both secret and public key), digital signatures and authentication; methods to create core cryptographic protocols primitives; analyze and practically use cryptosystems and such primitives as eliptic curves, hash-functions and secret-sharing methods. Basic methods for hiding information presented in steganography and watermarking. Finally, (s)he gets familiar in using quantum information processing tools and laws in general and in application to cryptography in particular. He gets also familiar with development and use cryptographic machines and with history of cryptography be experienced in methods of quantum cryptography and steganography

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptography and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory and linear codes
• Cyclic and channel codes, very modern coding methods
• Classical cryptography
• Public-key cryptosystems, knapsack, RSA, public key exchange
• Other cryptosystems and cryptographic primitives
• Digital signatures
• Elliptic curves in cryptography and integer factorization
• Basic cryptographic protocols
• Authentication, identification, secret sharing, e-commerce
• Steganography and watermarking
• From crypto-theory to crypto-practice
• Quantum cryptographic protocols
• Machines and history of cryptography

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Teaching methods

Lectures, in English Tutorials: one in English, one in Czech/Slovak Homeworks. 5-6 sets of 6-8 exercises chosen and evaluated by members of CRYPTO_team composed mostly of some of best students of previous IV054 lectures.

Assessment methods

Oral exam. Each student will get 5 questions. Number of question a student has to respond will depend on the number of points received for homeworks. Each student will get automatically A in case (s)he received number of points from exercises <= 85% of MAX - maximal number of points a studen got from exercises. Automatically a student gets B, with an easy way to get A, in case the number of points received is in interval (75,85)% og Max. a ....

Language of instruction

English

Further comments (probably available only in Czech)

Course is no more offered.
The course is taught: every week.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto19
Teaching materials: 1. Detailed slides of all lectures. Each chapter will consists of a (i) short Prologue, (ii) basic materials and an (iii) Appendix - for much demanding students 2. Appendix of fundamental discrete math and linear algebra - 45 pages 3. Two lecture notes of solved examples (at least 1000 in each one) 4. Posted solutions of homeworks.

IV054 Coding, Cryptography and Cryptographic Protocols

The course is not taught in Spring 2022

Extent and Intensity

2/1/2. 5 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Jozef Gruska, DrSc. (lecturer)
RNDr. Lukáš Boháč (seminar tutor)
RNDr. Matej Pivoluska, Ph.D. (seminar tutor)
Mgr. Luděk Matyska (assistant)
Mgr. Henrieta Micheľová (assistant)
Mgr. Anh Minh Tran (assistant)

Guaranteed by

prof. RNDr. Jozef Gruska, DrSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jozef Gruska, DrSc.
Supplier department: Department of Computer Science – Faculty of Informatics

Prerequisites

IA174 Fundaments of Cryptography && IA066 Quantum Computing - an intro
Basics of linear algebra and of the theory of numbers

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

there are 72 fields of study the course is directly associated with, display

Course objectives

The lecture deals with the basic methods to solve three key problems of the transmission of information. All three problems are of large practical importance and their solutions are based on elegant theoretical results.

Learning outcomes

On successful completion of the course students should be able to: understand problems of the theory of error-correcting codes; understand basic principles and results of the theory of secure communication; know principles and problems of basic cryptosystems for encryption (both secret and public key), digital signing and authentication; know methods to create core cryptographic protocols primitives; analyze and practically use simple cryptosystems; be experienced in methods of quantum cryptography and steganography

Syllabus

• Coding theory and modern cryptography are rich on deep, elegant, interesting and practically very important ideas, methods, and systems. Main concepts of modern cryptography are closely connected with fundamental concepts of theoretical informatics. Current cryptography and its methods and systems are of key importance for modern communication and information systems. Basic knowledge of coding methods and of modern cryptography are necessary for each graduate of informatics.
• Lecture will be rich also on examples and experiences from a very rich and interesting history of cryptography.
• Basic concepts of coding theory
• Linear codes
• Cyclic and channel codes
• Classical cryptography
• Public-key cryptosystems, knapsack, RSA, public key exchange
• Other cryptosystems and cryptographic primitives
• Digital signatures
• Elliptic curves in cryptography and integer factorization
• Basic cryptographic protocols
• Authentication, identification, secret sharing, e-commerce
• Steganography and watermarking
• From crypto-theory to crypto-practice
• Quantum cryptographic protocols
• Machines and history of cryptography

Literature

• GRUSKA, Jozef. Quantum computing. London: McGraw-Hill Companies, 1999, xv, 439. ISBN 0077095030. info
• GRUSKA, Jozef. Foundations of computing. London: International Thompson Computer Press, 1997, xv, 716 s. ISBN 1-85032-243-0. info
• SCHNEIER, Bruce. Applied cryptography : protocols, algorithms, and source code in C. New York: John Wiley & Sons, 1996, xxiii, 758. ISBN 0471128457. info
• SALOMAA, Arto. Public-key cryptography. 2nd ed. Berlin: Springer, 1996, x, 271. ISBN 3540613560. info
• STINSON, Douglas Robert. Cryptography :theory and practice. Boca Raton: CRC Press, 1995, 434 s. ISBN 0-8493-8521-0. info

Teaching methods

Lectures and homework

Assessment methods

Oral exam.

Language of instruction

English

Further comments (probably available only in Czech)

The course is taught annually.
The course is taught: every week.
General note: Výukové materiály (včetně průsvitek) výhradně v angličtině.

Listed among pre-requisites of other courses

• PA018 Advanced Topics in Information Technology Security
  PV017||PV079||PV157||IV054||IA174||now(IA174)||souhlas  
• PV079 Applied Cryptography
  IV054 || PřF:M0170 || IA174 || now(IA174) || souhlas  

Teacher's information

http://www.fi.muni.cz/usr/gruska/crypto19

• Enrolment Statistics (recent)