Rotational Cryptanalysis of Round-Reduced Keccak

Offered By: TheIACR via YouTube

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!

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.

Syllabus

Intro
Outline
rotation
bitwise operations
innovations
Representation
Red Squares
Distinguisher
Message Structure
Main Loop
Complexity
Grant Complexity
Conclusion

Taught by

TheIACR

Related Courses

Applied Cryptography
University of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera