COM-401: Cryptography and securityThis course introduces the basics of cryptography. We review several types of cryptographic primitives, when it is safe to use them and how to select the appropriate security parameters. We detail how
MATH-489: Number theory II.c - CryptographyThe goal of the course is to introduce basic notions from public key cryptography (PKC) as well as basic number-theoretic methods and algorithms for cryptanalysis of protocols and schemes based on PKC
MATH-410: Riemann surfacesThis course is an introduction to the theory of Riemann surfaces. Riemann surfaces naturally appear is mathematics in many different ways: as a result of analytic continuation, as quotients of complex
MATH-511: Number theory II.a - Modular formsIn this course we will introduce core concepts of the theory of modular forms and consider several applications of this theory to combinatorics, harmonic analysis, and geometric optimization.
MATH-101(g): Analysis IÉtudier les concepts fondamentaux d'analyse et le calcul différentiel et intégral des fonctions réelles d'une variable.
MATH-494: Topics in arithmetic geometryP-adic numbers are a number theoretic analogue of the real numbers, which interpolate between arithmetics, analysis and geometry. In this course we study their basic properties and give various applic
MATH-417: Number theory II.b - selected topicsThis year's topic is "Additive combinatorics and applications." We will introduce various methods from additive combinatorics, establish the sum-product theorem over finite fields and derive various a
MATH-310: AlgebraThis is an introduction to modern algebra: groups, rings and fields.
MATH-670: The theta correspondenceIn the course we will discuss some introductory aspects of the local/global theta correspondence for automorphic forms/representation for various dual pairs. One of the objectives will be to prove Wal
MATH-351: Advanced numerical analysis IIThe student will learn state-of-the-art algorithms for solving differential equations. The analysis and implementation of these algorithms will be discussed in some detail.