MiMC - Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
Offered By: TheIACR via YouTube
Course Description
Overview
Explore a cryptographic breakthrough in this Asiacrypt 2016 conference talk on MiMC (Minimal Multiplicative Complexity), a novel approach to efficient encryption and cryptographic hashing. Delve into the research presented by Martin R. Albrecht, Lorenzo Grassi, Christian Rechberger, Arnab Roy, and Tyge Tiessen as they introduce a cipher design that minimizes the number of multiplications in finite fields. Discover how MiMC achieves significant performance improvements in scenarios where multiplications are costly, such as multi-party computation protocols and SNARKs. Learn about the cipher's structure, security analysis, and potential applications in various cryptographic contexts. Gain insights into the future of lightweight cryptography and its implications for privacy-preserving technologies.
Syllabus
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative complexity
Taught by
TheIACR
Related Courses
Applied CryptographyUniversity 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