François Morain

1.9k total citations
22 papers, 459 citations indexed

About

François Morain is a scholar working on Information Systems, Geometry and Topology and Computational Theory and Mathematics. According to data from OpenAlex, François Morain has authored 22 papers receiving a total of 459 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Information Systems, 13 papers in Geometry and Topology and 13 papers in Computational Theory and Mathematics. Recurrent topics in François Morain's work include Cryptography and Residue Arithmetic (16 papers), Algebraic Geometry and Number Theory (13 papers) and Polynomial and algebraic computation (12 papers). François Morain is often cited by papers focused on Cryptography and Residue Arithmetic (16 papers), Algebraic Geometry and Number Theory (13 papers) and Polynomial and algebraic computation (12 papers). François Morain collaborates with scholars based in France, Austria and Canada. François Morain's co-authors include A. O. L. Atkin, Andreas Enge, Éric Schost, Bruno Salvy, Alin Bostan, Franck Leprévost, Antoine Joux, Reynald Lercier, Guillaume Hanrot and Preda Mihăilescu and has published in prestigious journals such as Mathematics of Computation, Journal of Cryptology and Journal of Number Theory.

In The Last Decade

François Morain

22 papers receiving 370 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
François Morain France 10 333 305 173 131 68 22 459
Edlyn Teske Canada 10 261 0.8× 297 1.0× 85 0.5× 87 0.7× 16 0.2× 14 367
Hans-Georg Rück Germany 10 314 0.9× 417 1.4× 201 1.2× 58 0.4× 42 0.6× 15 530
David Harvey Australia 11 147 0.4× 178 0.6× 82 0.5× 156 1.2× 46 0.7× 31 334
Andreas Enge France 9 189 0.6× 207 0.7× 111 0.6× 72 0.5× 22 0.3× 20 281
Victor S. Miller United States 4 204 0.6× 249 0.8× 67 0.4× 56 0.4× 26 0.4× 8 307
Gerhard Frey Germany 12 329 1.0× 376 1.2× 300 1.7× 91 0.7× 105 1.5× 45 678
Alan G. B. Lauder United Kingdom 11 72 0.2× 145 0.5× 129 0.7× 132 1.0× 56 0.8× 24 278
Jonathan Sorenson United States 9 93 0.3× 146 0.5× 42 0.2× 80 0.6× 63 0.9× 25 222
Ronald C. Mullin Canada 10 207 0.6× 341 1.1× 45 0.3× 107 0.8× 35 0.5× 22 457
Alin Bostan France 10 75 0.2× 107 0.4× 66 0.4× 180 1.4× 35 0.5× 28 272

Countries citing papers authored by François Morain

Since Specialization
Citations

This map shows the geographic impact of François Morain's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by François Morain with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites François Morain more than expected).

Fields of papers citing papers by François Morain

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by François Morain. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by François Morain. The network helps show where François Morain may publish in the future.

Co-authorship network of co-authors of François Morain

This figure shows the co-authorship network connecting the top 25 collaborators of François Morain. A scholar is included among the top collaborators of François Morain based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with François Morain. François Morain is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Enge, Andreas & François Morain. (2014). Generalised Weber functions. Acta Arithmetica. 164(4). 309–341. 2 indexed citations
2.
Morain, François. (2010). Computing the cardinality of CM elliptic curves using torsion points. Journal de Théorie des Nombres de Bordeaux. 19(3). 663–681. 3 indexed citations
3.
Bostan, Alin, François Morain, Bruno Salvy, & Éric Schost. (2008). Fast algorithms for computing isogenies between elliptic curves. Mathematics of Computation. 77(263). 1755–1778. 24 indexed citations
4.
Mihăilescu, Preda, François Morain, & Éric Schost. (2007). Computing the eigenvalue in the schoof-elkies-atkin algorithm using abelian lifts. 285–292. 4 indexed citations
5.
Morain, François. (2006). Implementing the asymptotically fast version of the elliptic curve primality proving algorithm. Mathematics of Computation. 76(257). 493–506. 15 indexed citations
6.
Gaudry, Pierrick & François Morain. (2006). Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm. HAL (Le Centre pour la Communication Scientifique Directe). 16. 109–115. 2 indexed citations
7.
Hanrot, Guillaume & François Morain. (2001). Solvability by radicals from an algorithmic point of view. 175–182. 4 indexed citations
8.
Lercier, Reynald & François Morain. (1999). Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm. Mathematics of Computation. 69(229). 351–371. 6 indexed citations
9.
Leprévost, Franck & François Morain. (1997). Revêtements de courbes elliptiques à multiplication complexe par des courbes hyperelliptiques et sommes de caractères. Journal of Number Theory. 64(2). 165–182. 9 indexed citations
10.
Joux, Antoine & François Morain. (1995). Character Sums Linked To Elliptic-Curves With Complex Multiplication. Journal of Number Theory. 55(1). 108–128. 7 indexed citations
11.
Morain, François. (1995). Calcul du nombre de points sur une courbe elliptique dans un corps fini : aspects algorithmiques. Journal de Théorie des Nombres de Bordeaux. 7(1). 255–282. 22 indexed citations
12.
Shallit, Jeffrey, Hugh C. Williams, & François Morain. (1995). Discovery of a lost factoring machine. The Mathematical Intelligencer. 17(3). 41–47. 1 indexed citations
13.
Atkin, A. O. L. & François Morain. (1993). Finding suitable curves for the elliptic curve method of factorization. Mathematics of Computation. 60(201). 399–405. 21 indexed citations
14.
Atkin, A. O. L. & François Morain. (1993). Finding Suitable Curves for the Elliptic Curve Method of Factorization. Mathematics of Computation. 60(201). 399–399. 10 indexed citations
15.
Atkin, A. O. L. & François Morain. (1993). Elliptic Curves and Primality Proving. Mathematics of Computation. 61(203). 29–29. 43 indexed citations
16.
Atkin, A. O. L. & François Morain. (1993). Elliptic curves and primality proving. Mathematics of Computation. 61(203). 29–68. 125 indexed citations
17.
Morain, François, et al.. (1992). Building Carmichael numbers with a large number of prime factors and generalization to other numbers. OpenGrey (Institut de l'Information Scientifique et Technique). 2 indexed citations
18.
Morain, François. (1992). Easy numbers for the elliptic curve primality proving algorithm. 263–268. 1 indexed citations
19.
Morain, François, et al.. (1990). Speeding up the computations on an elliptic curve using addition-subtraction chains. RAIRO - Theoretical Informatics and Applications. 24(6). 531–543. 125 indexed citations
20.
Morain, François. (1988). Implementation of the Atkin-Goldwasser-Kilian primality testing algorithm. OpenGrey (Institut de l'Information Scientifique et Technique). 8 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026