|
Lecturer(s)
|
-
Koucký Miroslav, doc. RNDr. CSc.
|
|
Course content
|
Theoretical background of cryptography and coding theory - Euclidian algorithm, modular arithmetics, quadratic residues, primality testing. - Finite fields, vector space. Cryptography - Basics of cryptography, Kerckhoff?s assumption, Kraft?s inequality. - Classical cryptography, symmetric-key system, Feistel ciphers, NDS, DES. - Public-key cryptosystem, hash functions, RSA. Coding theory - Basics of coding theory. - Linear codes, generating and parity check matrices, Hamming codes, cyclic codes, BCH codes.
|
|
Learning activities and teaching methods
|
Monological explanation (lecture, presentation,briefing)
- Preparation for exam
- 80 hours per semester
- Class attendance
- 56 hours per semester
|
|
Learning outcomes
|
Theoretical background of cryptography and coding theory - Euclidian algorithm, modular arithmetics, quadratic residues, primality testing, finite fields, vector space. Cryptography - basics of cryptography, Kerckhoff's assumption, Kraft's inequality. Classical cryptography, symmetric-key system, Feistel ciphers, NDS, DES. Public-key cryptosystem, hash functions, RSA. Coding theory - basics of coding theory. Linear codes, generating and parity check matrices, Hamming codes, cyclic codes, BCH codes.
Theoretical knowledge and ability to apply them.
|
|
Prerequisites
|
Knowledge of the secondary level mathematics
|
|
Assessment methods and criteria
|
Combined examination
Active participation in seminars, credit, knowledge according to syllabus.
|
|
Recommended literature
|
-
Adámek J. Kódování a teorie informace. ČVUT Praha, 1991. ISBN 8001006611.
-
Procházka L. Algebra. Praha, 1990. ISBN 8020003010.
|