Overview of Applied Algebra I shall give a somewhat personal introduction to applied algebra, starting with coding theory and cryptography and then leading to a wide variety of topics.

Entropy Regions and the Four-Atom Conjecture I shall introduce entropy regions, motivated by network coding, and then note how they are equiv- alent to something in finite group theory, allowing …

Low-Rank Matrix Completion I shall describe recommender systems such as Netflix, which seek to complete arrays from sparse data, and explain our recent work using algebraic geometry to obtain uniqueness …

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 …