|Computer Science/Discrete Mathematics Seminar I|
|Topic:||How Cryptosystems Are REALLY Broken|
|Date:||Monday, December 9|
|Time/Room:||11:15am - 12:15pm/S-101|
Most of the cryptosystems we currently use are highly secure, and cannot be broken with reasonable complexity 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 techniques of this type, and show how difficult it is to build a truly secure communication systems.