Events

Belgian Chocolate Problem I shall introduce the Belgian Chocolate Problem, a question from robust control theory amenable to algebraic attack and mysteriously connected to the abc conjecture, and a few …

Linearized polynomial modules and their application to network coding Linearized polynomials are a certain family of polynomials over finite fields. They form a non-commutative ring with the two operations addition …

The LWE-based key exchange Public key cryptosystems (PKC) are a critical part of the foundation of modern communication systems, in particular, the Internet. However Shor’s algorithm shows that the existing PKC …

Speakers: Frank R. Kschischang, University of Toronto Emina Soljanin, Rutgers University

Two families of Lightweight Cryptographic Primitives for Securing Internet-of-Things Internet-of-Things at large,  has become one of the most important challenges in computing today. Low-end embedded wireless devices  are deployed in an …

Modular forms for noncongruence subgroups: an introduction Modular forms for congruence subgroups have been studied for over one century. There are fabulous results and remarkable applications. On the other hand, …

Modular forms for noncongruence subgroups: recent progress and open problems Modular forms for congruence subgroups have been studied for over one century. There are fabulous results and remarkable applications. On …

An introduction to the principle of functoriality I will give a brief introduction to the principle of functoriality, which is one of the central components of the Langlands program. Then …

Level of Siegel modular forms of degree 2 coming from the $latex Sym^3$ lifting Ramakrishnan and Shahidi used the $latex Sym^3$ lifting to lift a holomorphic elliptic (non-CM) newform $latex …