C5

The elliptic curve discrete logarithm problem (ECDLP) is commonly believed to be much harder than its finite field counterpart, resulting in smaller cryptography key sizes. In this talk, we review recent results suggesting that ECDLP is not as hard as previously expected in the case of composite fields.

We first recall how Semaev's summation polynomials can be used to build index calculus algorithms for elliptic curves over composite fields. These ideas due to Pierrick Gaudry and Claus Diem reduce ECDLP over composite fields to the resolution of polynomial systems of equations over the base field.

We then argue that the particular structure of these systems makes them much easier to solve than generic systems of equations. In fact, the systems involved here can be seen as natural extensions of the well-known HFE systems, and many theoretical arguments and experimental results from HFE literature can be generalized to these systems as well.

Finally, we consider the application of this heuristic analysis to a particular ECDLP index calculus algorithm due to Claus Diem. As a main consequence, we provide evidence that ECDLP can be solved in heuristic subexponential time over composite fields. We conclude the talk with concrete complexity estimates for binary curves and perspectives for furture works.

The talk is based on joint works with Jean-Charles Faugère, Timothy Hodges, Yung-Ju Huang, Ludovic Perret, Jean-Jacques Quisquater, Guénaël Renault, Jacob Schlatter, Naoyuki Shinohara, Tsuyoshi Takagi

In this talk I will explain the basic motivation behind the trace formula and give some simple examples. I will then discuss how it can be used to prove things about automorphic representations on general reductive groups.

The maximal subgroups of the exceptional groups of Lie type

have been studied for many years, and have many applications, for

example in permutation group theory and in generation of finite

groups. In this talk I will survey what is currently known about the

maximal subgroups of exceptional groups, and our recent work on this

topic. We explore the connection with extending morphisms from finite

groups to algebraic groups.

A finite set of elements in a connected real Lie group is "Diophantine" if non-identity short words in the set all lie far away from the identity. It has long been understood that in abelian groups, such sets are abundant. In this talk I will discuss recent work of Aka; Breuillard; Rosenzweig and de Saxce concerning this phenomenon (and its limitations) in the more general setting of nilpotent groups. 

In the first part of the talk we are going to build up some intuition about limit-periodic functions and I will explain why they are the 'simplest' class of arithmetic functions appearing in analytic number theory. In the second part, I will give an equivalent description of 'limit-periodicity' by using exponential sums and explain how this property allows us to solve 'twin-prime'-like problems by the circle method.