Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA

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.

Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA.