general introduction: symmetric and asymmetric encryption,
applications of asymmetric encryption for confidentiality and authentication,
hash functions and legal contracts, challenge and response authentication
with mutual authentication, Onion Routing for anonymity
symmetric encryption: substitution ciphers and frequency analysis,
example of a scheme for manual encryption,
one-time pad, perfect security property, key length problem,
stream ciphers and pseudorandom
bit generators, LFSR and attacks on LFSR - recovering
tap sequence and recovering previous state,
design of A5/1 generator and its usage for GSM;
block ciphers: Feistel construction,
design of DES,
linear cryptanalysis, IDEA, AES, RC5, encryption modes:
ECB, CBC, CFB, double and triple encryption, Two-fish and saturation attack,
differential cryptanalysis: fault analysis, 3-round and 4-round DES (characteristics),
linear cryptanalysis,
encryption of disks,
asymmetric encryption:
basics of discrete log systems: Zp, inverting elements with generalized Euclidean algorithm, binary GCD, generators, Descrete Logarithm Problem,
DL algorithms: baby-step giant step, Floyd'smethod and Pollard rho algorithm,
Chinease Reminder Theorem, Pohling-Hellman,
ElGamal enryption, Elgamal signature scheme - design method,
attacks for bad randomness,
DSA signatures, bilinear mappings and ID based cryptography,
RSA: RSA encryption and decryption,
square roots modulo RSA number, random squares attack, factor base method,
deriving private key versus factorization, common modulus, rho-Pollard
factoring, fault attacks, generating RSA numbers:
density of primes, Fermat test,
Rabin-Miller test,
generating RSA parameters, efficient modular exponentiation,
multiplication attack,
hard bit of RSA, Blum-Goldwasser probabilistic encryption,