Explore a groundbreaking algorithm for solving the unbalanced meet-in-the-middle problem in this 29-minute talk presented by Ivica Nikolic and Yu Sasaki at Asiacrypt 2016. Delve into the intricacies of this novel approach, which addresses a fundamental challenge in cryptography and computational problem-solving. Gain insights into the algorithm's design, implementation, and potential applications in various fields of computer science and cryptography.
A New Algorithm for the Unbalanced Meet in the Middle Problem
Overview
Syllabus
A New Algorithm for the Unbalanced Meet in the Middle Problem
Taught by
TheIACR
Related Courses
-
Quantum Multicollision Finding Algorithm
-
Low Weight Discrete Logarithms and Subset Sum in - with Polynomial Memory
-
A Simple and Compact Algorithm for SIDH with Arbitrary Degree Isogenies
-
New Impossible Differential Search Tool from Design and Cryptanalysis Aspects
-
Automatic Search of Meet in the Middle and Impossible Differential Attacks
-
Exhausting Demirci-Selçuk Meet-in-the-Middle Attacks Against Reduced-Round AES
