Introduces hashing tables, including the Birthday Lemma, Direct-Address Tables, collisions, and Chained-Hash-Search.
Covers cryptographic security fundamentals, including collision search algorithms, public-key cryptography, and risks of underestimating collision attacks.
Covers the analysis of hash tables, including search operations and expected collisions.
Covers hashing, sorting, extendible hashing, linear hashing, and external sorting.
Covers conditional access, encryption, decryption, authentication, and advanced encryption standards, exploring identity-based encryption, biometrics, and attribute-based encryption.
Explores hash table efficiency, total functions in code modeling, and well-founded relations for recursive function termination.
Explores RSA encryption, trapdoor functions, hash functions, and cryptographic standards, including a practical example with Apple's iMessage implementation.
