A linear error correcting code is a subspace of a finite-dimensional space over a finite field with a fixed coordinate system. Such a code is said to be locally recoverable with locality r if, for every coordinate, its value at a codeword can be deduced from the value of (certain) r other coordinates of the codeword. These codes have found many recent applications, e.g., to distributed cloud storage.
We will discuss the problem of constructing good locally recoverable codes and present some constructions using algebraic surfaces that improve previous constructions and sometimes provide codes that are optimal in a precise sense.[-]

It is an understatement to say that isogeny-based cryptography has been on a journey of ups and downs. Through the course of this journey, various techniques have been used to analyse isogeny-based cryptosystems. One of which, is using genus two methods to examine and build isogeny-based cryptosystems, and ultimately break one of the most promising key exchange schemes, SIDH. In this talk, we will look at cameos and appearances of genus two in isogeny-based cryptography. We will survey the landscape and see how genus two can be used constructively and sometimes destructively on isogeny-based cryptography.[-]

Finding an explicit isogeny between two given isogenous elliptic curves over a finite field is considered a hard problem, even for quantum computers. In 2011 this led Jao and De Feo to propose a key exchange protocol that became known as SIDH, shorthand for Supersingular Isogeny Diÿe-Hellman. The security of SIDH does not rely on a pure isogeny problem, due to certain 'auxiliary' elliptic curve points that are exchanged during the protocol (for constructive reasons). In this talk I will discuss a break of SIDH that was discovered in collaboration with Thomas Decru. The attack uses isogenies between abelian surfaces and exploits the aforementioned auxiliary points, so it does not break the pure isogeny problem. I will also discuss improvements of this attack due to Maino et al. and Robert, as well as a countermeasure by Fouotsa et al., along with breaks of this countermeasure in some special cases.[-]

In the field of coding theory, Goppa's construction of error-correcting codes on algebraic curves has been widely studied and applied. As noticed by M. Tsfasman and S. Vlădut¸, this construction can be generalized to any algebraic variety. This talk aims to shed light on the case of surfaces and expand the understanding of Goppa's construction beyond curves. After discussing the motivations for considering codes from higher–dimensional varieties, we will compare and contrast codes from curves and codes from surfaces, notably regarding the computation of their parameters, their local properties, and asymptotic constructions.[-]