|
Lecturer(s)
|
-
Jirsák Čeněk, Mgr.
-
Koucký Miroslav, doc. RNDr. CSc.
|
|
Course content
|
Introduction to applied algebra - divisibility, groups, rings, finite fields, polynomials Introductiuon to cryptology - symmetric cryptosystems (transposition, substitution), asymmetric cryptosystems (RSA) Introduction to coding - noiseless (Kraft's inequality), error-correcting codes (linear codes)
|
|
Learning activities and teaching methods
|
Monological explanation (lecture, presentation,briefing)
- Preparation for exam
- 90 hours per semester
- Class attendance
- 56 hours per semester
|
|
Learning outcomes
|
The subject involves two parts - introduction to applied algebra, cryptography and coding theory.
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 accordant with syllabus.
|
|
Recommended literature
|
-
Adámek J. Kódování. SNTL, Praha 1989. &, &.
-
Bečvář J. Úvod do algebry. Skripta MFF UK, SPN, Praha 1984..
-
Chajda I., Halaš R. Cvičení z algebry. UP Olomouc, Olomouc 1995.
-
Nešetřil J., Matoušek, J. Kapitoly z diskrétní matematiky. Praha, Karolinum, 2000.
|