general introduction: symmetric encryption
(one-time-pad, perfect security, problem of multiple encryptions,
stream ciphers and pseudorandom number generators,
LFSRs and their weaknesses, A5/1)
asymmetric encryption
(applications of asymmetric encryption for confidentiality and authentication),
hash functions and legal contracts, conflict freeness,
challenge and response authentication protocol,
Onion Routing for anonymity
symmetric encryption: substitution ciphers and frequency analysis,
example of manual encryption, RC4 cipher,
block ciphers: ECB, CBC, encryption of hard disks
block ciphers: Feistel construction,
RC5,
design of DES, double and triple encryption,
differential cryptanalysis: fault analysis, 3-round and 4-round DES (characteristics),
linear cryptanalysis, AES design criteria, AES design
asymmetric encryption:
basics of discrete log systems: Zp, inverting elements with generalized Euclidean algorithm, binary GCD, generators, Discrete Logarithm Problem,
DL algorithms: baby-step giant step, Floyd's method and Pollard rho algorithm,
ElGamal enryption, Elgamal signature scheme - design method,
attacks for bad randomness,
Schnorr signatures,
RSA: encryption and decryption,
RSA: Chinease Reminder Theorem,
square roots modulo RSA number,
factorisation methods, ro-Pollard algorithm,
random squares attack,
probabilistic encryption with RSA, hard bit of RSA,
deriving private key versus factorization, common modulus,
generating RSA numbers:
density of primes, Fermat test,
Rabin-Miller test,
efficient modular exponentiation,
fault attack multiplication attack,
bilinear mappings, ID based cryptography - encryption based on bilinear
mappings,
key management and authentication:
Shamir no key protocol, DH and man-in-the-middle,
MTI, DH with implicitely certified keys,
Kerberos, random key predistribution,
Blom scheme, zero knowledge proofs: Fiat-Shamir, Feige-Fiat-Shamir,
authentication with hash chains, microTESLA,