Event title

"How Cryptosystems Are Really Broken" 

Abstract

"Most of the cryptosystems we currently use are highly secure, and cannot be broken by mathematical cryptanalysis. However, over the last fifteen years researchers have developed many types of physical attacks on their implementations which can easily bypass their mathematical security. In this talk I will survey some of the latest attacks and show how difficult it is to build a truly secure communications system. The talk will not require any prior knowledge in cryptoanalysis."

Bio

Adi Shamir is an Israeli cryptographer who has made numerous groundbreaking contributions to the theory and practice of computer science. The Paul and Marlene Borman Professor of Applied Mathematics at the Weizmann Institute of Science, Shamir is the 2002 winner of the ACM Turing Award for co-inventing (with Rivest and Adelman) the RSA cryptosystem, among countless other contributions to cryptography and cryptanalysis (code-breaking). He is well known for proving the equivalence of IP and PSPACE, and for his work on devices for factoring large integers. Shamir is also the recipient of (among others) the Erdos Prize and the Paris Kanellakis Theory and Practice Award.