The Iterated Random Function Problem

The Iterated Random Function Problem

Explore a cryptographic research presentation on the Iterated Random Function Problem, delivered at Asiacrypt 2017. Delve into the adaptive collision fighting attack, best known attack models, and key concepts like random functions, collisions, and permutation cycles. Learn about the H2 efficient technique and its applications in cryptography. Gain insights from the work of researchers Ritam Bhaumik, Nilanjan Datta, Avijit Dutta, Nicky Mouha, and Mridul Nandi as they discuss their findings in this 28-minute talk.