Info on CNS
Conditions

Cryptography and Network Security
Subject of the group A for Informatics  Cryptology
Term: summer
Extent: 31
Year: 1st graduate study
Lecturer: RNDr. Karol Nemoga, PhD.
Proportion of final exam in the course completion: 50%.
Keywords: Pseudorandom sequence, hash function, protocol, digital signature, PKI,
network security, mobile telecommunications security.
Anotation: Properties of finite fields and sequences over finite fields. Hash
functions, message authentication and their applications on cryptography practice. Basic
cryptographic protocols, authentication protocols, digital signature, PKI systems.
Description of selected systems  Kerberos, X.509, PGP, S/MIME. Standardisation
in Cryptography. Pseudorandom sequences, LubyRackoff generators.
Syllabus  in twelve points:
 Finite fields , polynomials and sequences over finite fields (cyclotomice polynomials, period of a sequence, infinite formal series).
 Linear feedback shift register seuences (LFSRs). Linear and nonlinear compositions of LFSRs. Linear and weight complexity of LFSRs.
 Message authentication and hash ffunctions. Basic properties, selected hash functions  MD4, MD5, RIPEMD 160, SHA 1, ...
 Protocols in cryptology. Basic types, protocol based on symmetric and assymetric functions, zero knowledge protocols, time stamping.
 Authentication and key exchange protocols, completeness and soundness of protocols.
 Digital signature, PKI systems (standards FIPS 186, DSS, DSA, X.509).
 Electronic mail security (PGP, S/MIME).
 WEB security, IP security (SSL, SET, SHTTP, IP security overview and architecture).
 Pseudorandom numbers generators (PRNG), construction of cryptographic PRNG.Computational indistinguishability of two probability ensambles, LubyRackoff generators.
 Cryptographic standards, cryptographic primitives (standards: ISO, NIST, FIPS, ANSI, X9, IEEE, P1363, ECMA, RFC, ETSI, ... . Selected standards: FIPS 1401, FIPS 1861, X509, X9.62.)
 Operation systems security, database security, distributed applications.
 Mobile telecommunication security (GSM, UMTS).
Target: In the first part the theory of finite fields, sequences over finite fields
and hash and MAC functions are studied. The second part is devoted to cryptographic
protocols, basic types, selected protocols and their security. Pseudorandom number generators,
their properties are studied in the third part. Network security practice (mail , IP, WEB
security), mobile telecommunication security incl., are explained in the fourth part.
Recommended prerequisites: The lecture is continuation of the course Cryptology.
Bibliography:
 Foreign:
 A.J. Menezes, P.C. van Oorschot, S.A. Vanstone: Handbook of Applied Crytography. http://cacr.math.uwaterloo.ca/hac/
 W. Stallings: Cryptography and Network Security. Prentice Hall, New Jersey, 1999
Notices: The course is finished by the final state examination.
