Speaker: Professor Adi Shamir Poster

Computer Science Department, The Weizmann Institute of Science, Israel

Date: 2011-04-18 09:30am

Venue: Conference Hall 104，Science Building

Abstract: Many questions in cryptography can be phrased as algorithmic problems in the theory of random graphs, and the two areas influenced each

other considerably over the last 30 years. In this talk I'll describe some of these connections, survey the most interesting results, and show some

recently discovered techniques how a cryptanalyst can exploit slight deviations from randomness in order to speed up various attacks.