Tweakable Blockciphers with Asymptotically Optimal Security
Offered By: TheIACR via YouTube
Course Description
Overview
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.
Syllabus
Intro
Parameter
Hash Functions
App Function
Inquisition Question
Analysis
The Truth
Random Permutation
Distribution View
Example
Open Question
Taught by
TheIACR
Related Courses
Requirements Specifications: Goals and Conflict AnalysisUniversity of Colorado System via Coursera Threat and Vulnerability Management for CompTIA CySA+
Pluralsight Network Security Monitoring (NSM) with Security Onion
Pluralsight Security Event Triage: Operationalizing Security Analysis
Pluralsight Complete Guide to Elasticsearch
Udemy