Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Theoretic Cryptography I - NMMB307

Title:	Teoretická kryptografie I
Guaranteed by:	Department of Algebra (32-KA)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2021
Semester:	winter
E-Credits:	3
Hours per week, examination:	winter s.:2/0, Ex [HT]
Capacity:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	not taught
Language:	Czech
Teaching methods:	full-time
Teaching methods:	full-time
Additional information:	https://www.sent.cz/TK/

Guarantor:	Mgr. Robert El Bashir, Ph.D.
Class:	M Bc. MMIB M Bc. MMIB > Povinné M Bc. MMIT M Bc. MMIT > Povinné M Bc. OM M Bc. OM > Povinně volitelné
Classification:	Mathematics > Algebra
Incompatibility :	NMMB305, NMMB335
Interchangeability :	NMMB305, NMMB335
Is incompatible with:	NMMB335
Is interchangeable with:	NMMB335

Opinion survey results Examination dates Schedule Noticeboard

Annotation -

Last update: doc. Mgr. et Mgr. Jan Žemlička, Ph.D. (09.05.2018)

Required course for bachelor's program in Information security. The course describes basic methods and problems of cryptography. One by one, basic cryptographic primitives (modules) are described.

Course completion requirements -

Last update: doc. Mgr. et Mgr. Jan Žemlička, Ph.D. (28.10.2019)

Students have to pass oral exam.

Literature -

Last update: doc. Mgr. et Mgr. Jan Žemlička, Ph.D. (09.05.2018)

Neal Koblitz: Algebraic aspects of cryptography, Springer Verlag 1998;

Douglas R. Stinson: Cryptography: Theory and practice, Chapman and Hall, Boca Raton, 2006.

Serge Vaudenay, A classical introduction to cryptography: applications for communications security, Springer, New York, 2006.

Michael Luby: Pseudorandomness and cryptographic applications, Princeton Univ Pr. Princeton 1996.

Teaching methods - Czech

Last update: doc. Mgr. et Mgr. Jan Žemlička, Ph.D. (25.09.2020)

Postupně sepisovaná témata jsou vystavována na https://www.sent.cz/TK/, konzultace na e-mailu rb@sent.cz.

Requirements to the exam -

Last update: doc. Mgr. et Mgr. Jan Žemlička, Ph.D. (28.10.2019)

Students have to pass oral exam. The requirements for the exam correspond to what has been done during lectures.

Syllabus -

Last update: doc. Mgr. et Mgr. Jan Žemlička, Ph.D. (09.05.2018)

Shannon theory, symmetric cryptography, linear reccuring requences (period, spectrum, randomness criteria, Berlekamp-Massey algorithm), Boolean functions (spectrum, correlation matrix, difference propagation, cryptographic criteria).