Subjects

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

Theoretic Cryptography - NMMB305

Title:	Teoretická kryptografie
Guaranteed by:	Department of Algebra (32-KA)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2018
Semester:	winter
E-Credits:	6
Hours per week, examination:	winter s.:3/1, C+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

Guarantor:	Mgr. Robert El Bashir, Ph.D.
Class:	M Bc. MMIB
Classification:	Mathematics > Algebra
Incompatibility :	NMIB005, NMMB308
Interchangeability :	NMIB005, NMMB308
Is incompatible with:	NMMB336, NMMB308, NMMB335, NMMB307
Is interchangeable with:	NMMB335, NMMB336, NMMB307, NMIB005, NMMB308

Opinion survey results Examination dates Schedule Noticeboard

Annotation -

Last update: G_M (16.05.2012)

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. The course also contains implementation and overview of the most important protocols.

Course completion requirements - Czech

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

Zápočet student získá za systematickou práci v semestru nebo vyřešení zápočtové úlohy v rámci zkoušky

Literature -

Last update: T_KA (14.05.2012)

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.

Requirements to the exam - Czech

Last update: Mgr. Robert El Bashir, Ph.D. (12.10.2017)

Zkouška je ústní. Požadavky ke zkoušce odpovídají sylabu předmětu v rozsahu, který byl prezentován na přednášce.

Syllabus -

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

Shannon theory, symmetric cryptography, linear reccuring requences (period, spectrum, randomness criteria, Berlekamp-Massey algorithm), Boolean functions (spectrum, correlation matrix, difference propagation, cryptographic criteria), block cipher construction, hash function, public-key cryptography, signature scheme.