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.
Introduces hashing tables, including the Birthday Lemma, Direct-Address Tables, collisions, and Chained-Hash-Search.
Explores distributed randomness using Drand, covering cryptographic tools, key exchange, elliptic curve cryptography, and practical applications in blockchain systems.
Covers hashing, sorting, extendible hashing, linear hashing, and external sorting.
Explores lexicons, n-grams, and language models, emphasizing their importance in recognizing words and the effectiveness of n-grams for various tasks.
Explores RSA encryption, trapdoor functions, hash functions, and cryptographic standards, including a practical example with Apple's iMessage implementation.
Explores hash table efficiency, total functions in code modeling, and well-founded relations for recursive function termination.
