Explore a comprehensive analysis of Small CRT Exponent RSA in this 20-minute conference talk presented at Eurocrypt 2017. Delve into the research findings of Atsushi Takayasu, Yao Lu, and Liqiang Peng as they revisit and expand upon this cryptographic topic. Gain insights into the latest developments and potential vulnerabilities in RSA encryption with small CRT exponents, and understand the implications for modern cryptographic systems.
Overview
Syllabus
Small CRT Exponent RSA Revisited
Taught by
TheIACR
Related Courses
-
Faster Algorithms for Approximate Common Divisors
-
Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
-
A Decade After Bleichenbacher '06, RSA Signature Forgery Still Works
-
Encryption Switching Protocols Revisited - Switching Modulo P
-
Evolving Ramp Secret Sharing with a Small Gap
-
Functional Graph Revisited - Updates on Second Preimage Attacks on Hash Combiners
