Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
Offered By: TheIACR via YouTube
Course Description
Overview
Explore a talk from PKC 2010 that delves into the optimization of small root bounds through linearization techniques and their applications to RSA cryptosystems with small secret exponents. Presented by authors Mathias Herrmann and Alexander May, this 23-minute presentation offers insights into advanced cryptographic concepts and their practical implications for enhancing security in RSA implementations.
Syllabus
Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA.
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