Scrypt is Maximally Memory Hard
Offered By: TheIACR via YouTube
Course Description
Overview
Explore a comprehensive analysis of the Scrypt memory-hard function presented at Eurocrypt 2017. Delve into the paper by Joël Alwen, Binyi Chen, Krzysztof Pietrzak, Leonid Reyzin, and Stefano Tessaro, which examines time complexity, memory-hard functions, and IMH halves. Learn about the run game, simple and general strategies, and technical barriers associated with Scrypt. Gain insights into the maximally memory-hard properties of this cryptographic function through a structured presentation covering introduction, outline, romics, summary, and conclusion, followed by a Q&A session.
Syllabus
Intro
Time complexity
Memory hard function
IMH halves
A script
Outline
Romics
Run Game
Simple Strategy
General Strategy
Technical Barriers
Summary
Conclusion
Questions
Taught by
TheIACR
Related Courses
Probabilistic Graphical Models 1: RepresentationStanford University via Coursera Computer Security
Stanford University via Coursera Intro to Computer Science
University of Virginia via Udacity Introduction to Logic
Stanford University via Coursera Internet History, Technology, and Security
University of Michigan via Coursera