Alexei Miasnikov
(McGill)

"Modern Cryptanalysis: generic complexity and asymptotic dominance"

In this talk I am going to discuss two recent developments in modern cryptanalysis: generic complexity and asymptotic dominance. The first one concerns with the behavior of algorithms on most typical or "generic" inputs, while the second one deals with the asymptotically most dominant properties of algebraic objects. My focus will be on some new intriguing problems and ideas that are coming to mathematics and computer science from modern cryptography.

The Colloquium is supported by generous contributions from the Bloomberg, Information Builders, Inc. and Netlogic, Inc.