We will talk about Drinfeld modules, and how they compare to elliptic curves for algorithms and computations.
Drinfeld modules can be seen as function field analogues of elliptic curves. They were introduced in the 1970's by Vladimir Drinfeld, to create an explicit class field theory of function fields. They were instrumental to prove the Langlands program for GL2 of a function field, or the function field analogue of the Riemann hypothesis.
Elliptic curves, to the surprise of many theoretical number theorists, became a fundamental computational tool, especially in the context of cryptography (elliptic curve Diffie-Hellman, isogeny-based post-quantum cryptography) and computer algebra (ECM method).
Despite a rather abstract definition, Drinfeld modules offer a lot of computational advantages over elliptic curves: one can benefit from function field arithmetics, and from objects called Ore polynomials and Anderson motives.
We will use two examples to highlight the practicality of Drinfeld modules computations, and mention some applications.