This course is a non-obligatory course for undegraduate program in Computer Science and Algorithmics.
The course is in Polish, but all materials, for students convenience will be in English.
Our goal is to learn basic principles of cryptographic technology today. All topics that today every good specialist in computer science
should know. However, it will be neither focused on math nor on programming. The key issue is to be aware of the threats as well as of
fundamental defensive tools. If somebody will get excited -- no problem, there is a master program Cryptography and Computer Security...
This lecture will be focused on "concrete cryptography" (following the concept of the famous book "Concrete Mathematics").
There are many topics that fall into the subject "Computer Security" which is not cryptography. I hope you will have an opportunity
to take the course "Computer Security".
Current schedule:
lectures: Thursday, 9:15-11, MS Teams platform, MS Teams platform
exercises: by Marta Słowik and Marcin Słowik, link to exercises
however, as usual, realization will be adjusted to the current situation
Basic literature:
some electronic teaching material and links will be available
here, access with a password
to be given during the lecture
Requirements:
Presence during the lectures is obligatory, note that there is
an automatic collection of presence data.
In order to pass the course it is necessary to obtain at least 40% of points.
The following scale applies:
[40,50) - 3.0
[50,60 ) - 3.5
[60,70 ) - 4
[70,80 ] - 4.5
over 80 - 5
5.5 will be given for extraordinary achievements
The points are to be earned:
lecture: very short tests at the beginning of the lecture, online probably over MS Teams, together about 4, each with 0-2 points (2= problem solved
with at most minor flaws, 1= problem solved with major flaw, 0=otherwise), each test announced 1 week in advance
homework: assigned during exercises (number to be determined, 0-2 points as for the tests
exercises: short in-class tests on paper, grading as above but may be rescaled assording to the weight of the problem
The verification process will check understanding, skills, creativity related to problem solving.
It is unnecessary to remember details of algorithms, protocols, technical manuals, ...
but it will be necessary to understand them.
Intellectual Property Rights: no work can be accepted/evaluated in case of
violation of intellectual property rights by the student. Such work will be non-existent
from the point of view of learning points. The approach will be strict!
Prerequisitives:
Some knowledge from the algebra course will be helpful.
copyright note:
The students enrolled to the course get an unlimited royalty-free license for using the course teaching material
as long as personal educational use is concerned.