Tweakable Blockciphers with Asymptotically Optimal Security

Explore a cryptographic talk from FSE 2013 on tweakable blockciphers with asymptotically optimal security, presented by Rodolphe Lampe and Yannick Seurin. Delve into topics such as parameter hash functions, application functions, and random permutations. Examine the analysis, distribution view, and examples provided, and consider the open questions posed in this 24-minute presentation that offers insights into advanced cryptographic concepts.

Intro
Parameter
Hash Functions
App Function
Inquisition Question
Analysis
The Truth
Random Permutation
Distribution View
Example
Open Question