Explore rotational cryptanalysis techniques applied to round-reduced Keccak in this FSE 2013 conference talk. Delve into the innovative approach presented by Pawel Morawiecki, Josef Pieprzyk, and Marian Srebrny as they discuss bitwise operations, representation methods, and distinguishers. Examine the intricacies of message structure, main loop complexity, and grant complexity. Gain insights into the researchers' findings and conclusions regarding this cryptographic analysis of the Keccak algorithm.
Overview
Syllabus
Intro
Outline
rotation
bitwise operations
innovations
Representation
Red Squares
Distinguisher
Message Structure
Main Loop
Complexity
Grant Complexity
Conclusion
Taught by
TheIACR
