1 written test, 29.11.2011 (Tuesday) and its
results
,
the second chance: 7.12.2011, A1-204, 13:15-15
and the final results
getting ``wpis'': Monday, 12.12.11, 13:15-14,
Tuesday, 13.12.11, 16-16:50, Monday 19.12, 9-11, Tuesday 20.12, 16-16:50, D1-214B,
or in regular office hours (not on 14.12.2011)
there will be the last chance for students that have got at least 10
weighted points for weekly tests, 20.12, 14-16, please register by email
sent to me
Program
the official program of the course
is available here It may be adjusted according to the needs of the students and advances of
technology.
Handbook of Applied CryptographyA.J.Menezes, P.C van Oorschot, S.A.Vanstone ,
CRC, 1996, ISBN 0-8493-8523-7.
(available here)
Additional literature:
there is a growing number of books available, some titles
D.R.Stinson , Cryptography. Theory and Practice,
CRC Press, 1995, ISBN 0-8493-8521-0, the second edition 2002,
the third edition 2005
N.Koblitz , Algebraiczne aspekty kryptografii,
WNT, 2000,
ISBN ISBN 83-204-2418-6.
W. Stallings , Ochrona danych w sieci i intersieci,
Wydawnictwa Naukowo-Techniczne, Warszawa 1997, ISBN 83-204-2184-5;
translation from: Network and Internetwork Security,
Prentice Hall, Englewood Cliffs, 1995, ISBN 0-13-180050-7.
Reinhardt Wobst Kryptologia. Budowa i lamanie zabezpieczen,
Wydawnictwo READ ME, ISBN 83-7243-068-3
Requirements:
This is a "grupa kursów" - only one grade will be given.
The grade for the course will be based on the sum of:
the points from the test
during the lectures.
the points obtained during tutorials according to the rules determined there.
The points will be recalculated so that in each part it will be possible to get 50 weighted points.
The minimal number of points to pass the course will be no higher than 40 (may be slightly lower).
For grade ''very good'' it is necessary to get 80 points.
The written tests will check understanding, skills and ability of problem solving.
It will consist of short problems
that will demand certain creativity and careful rethinking.
It is not necessary to remember details of algorithms and protocols,
but it will be necessary to understand them well.
Usually, the details which are hard to remember, will be recalled on the
question sheet. It will be allowed to bring own notices, books, ...
Goals:
presentation of technologies of contemporary cryptography -
mathematical foundations, algorithms and
protocols, implementation issues, and some legal issues.
Prerequisitives:
some knowledge of modular arithmetics, algorithms,
computational complexity, computer networks