Information and materials to the lecture (sylabus v IS).
ASSIGNMENTS: An important component of the lecture are home exercises - for the first 10 lectures. They will be posted always the day before the lecture, that is on TUESDAYS, at 18.00. Conditions for submiting and evaluation of exercices, as well as for exams and "zapocet". More points one gets from exercises more easy will be final exam.TUTORIALS: For the course IV054 there will be held regularly also not obligatory tutorials/seminars.
The goal of tutorials/seminars will be to make more clear topics discussed during the lecture as well as some of its (especially mathematical) requirements.
One of the tutorials will be in Czech/Slovak with RNDr. Matej Pivoluska PhD. First tutorial will be on Wendesday at 16.00 in A217.
Second tutorial will be in English and again with RNDr. Matej Pivoluska PhD. Second tutorial will be on Thursday at 18.00 in A318.
Appendix!!!!!: The materials to the course contains
in addition to slides of the lectures also an Appendix. It is much recomended to all registered
for the course to look first, before lectures start, to the
Appendix for a review of some basic concepts and facts from algebra and discrete
mathematics that will be used in the course. This is of importance
especially for those who do not feel very good in these areas.
Contacts: gruska@fi.muni.cz
Teaching hours: streda 10:00-11:40, 2015, D2
Office hours: Wendesday 13-14 J. Gruska B402, Tuesday 16-18
M. Pivoluska C516, pondelok 14.00-16.00 or by arrangements through email.
Exams: 17.12.2015 o 8.00 v A503, 05.01.1916 8.00 v
B411, 14.01.2016 o 13.00 v B410, 20.01.2016 o 8.00 v B410, 27.01.2016
o 8.00 v B410.
Thanks: The current web papge of the course was created for the benefit of all involved by Peter Boros, a former student of IV054
Slides for future lectures accessible bellow and denoted as old are from the course given in 2014. Modified and/or updated version of the slides will be usualy posted the day before the lecture and also after the lecture.
Perhaps the most effective way to deal with the course is to print new slides just before the lecture, to read them, and then, during the lecture to write into the printed version of the slides various comments and/or explanations.
| Contents | Contents of the lecture | ||||
|---|---|---|---|---|---|
| Literature | List of literature | ||||
| Lecture 1 | Basics of coding - new | Slides | 2×2 handouts | Exercises - new | |
| Lecture 2 | Linear codes- new | Slides | 2×2 handouts | Exercises - new | |
| Lecture 3 | Cyclic codes and channel codes - new | Slides | 2×2 handouts | Exercises - new | |
| Lecture 4 | Secret key cryptography- new | Slides | 2×2 handouts | Exercises - new | Exercises - new |
| Lecture 5 | Public key cryptography: key exchange, knapsack, RSA - new | Slides | 2×2 handouts | Exercises - new | |
| Lecture 6 | Other public-key cryptosystems and basic cryptographic primitives - new | Slides | 2×2 handouts | Exercises - new | |
| Lecture 7 | Digital signatures - new | Slides | 2×2 handouts | Exercises - new | |
| Lecture 8 | Cryptography of eliptic curves and factorization-new | Slides | 2×2 handouts | Exercises - new | |
| Lecture 9 | Authentication, identification, secret sharing and e-busines - new | Slides | 2×2 handouts | Exercises - new - Last ones | |
| Lecture 10 | Protocols doing seemingly impossible - new | Slides | 2×2 handouts | ||
| Lecture 11 | Quantum cryptography - new | Slides | — | ||
| Appendix | Algebra and number theory introduction | Appendix | |||