Elliptic curves with complex multiplication: history and perspectives

Elliptic curves with complex multiplication: history and perspectives
The theory of complex multiplication on curves is very old and rich, going back at least to Klein. Since then, many authors have been developing the theory, in parallel with quite a heavy load of computations and formulas (by hand!). Soon after Schoof’s 1985 major article, reduction of curves with complex multiplication over finite fields were used to prove the primality of special or general numbers, and the corresponding algorithms are still in use today. As a result, this led to the emergence of the so-called CM-method to build curves with prescribed properties. The talk will present some parts of this history, concentrating on explicit computations and applications of the CM theory to some old and new problems.

Speaker Details

F. Morain is Professor at École Polytechnique in France, and head of the Project-Team TANC (Algorithmic Number Theory for Cryptology) of INRIA Saclay Ile de France. His main interests involve the application of elliptic curves to various problems in number theory, including primality proving of large integers (ECPP and fastECPP), and cardinality computations. He holds two records: the largest ordinary number proven prime (> 20,000 decimal digits) and the computation of cardinalities of elliptic curves over large finite fields (2,500 decimal digits), both obtained using distributed computations.

Date:
Speakers:
Francois Morain
Affiliation:
Ecole polytechnique

    • Portrait of Jeff Running

      Jeff Running