AI, Data Science & Cloud Certificates from Google, IBM & Meta — 50% Off
One plan covers every Professional Certificate on Coursera. 50% off Coursera Plus Annual for 10 days only — price increases June 17.
Unlock All Certificates
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.
