◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

F. Morain

9 papers hereh-index 232.7k citations57 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author2
  • middle author3
  • last author2

Across the 8 of 9 papers where every author was matched, so the position is known.

fields
  • math.NT6
  • cs.CC1
  • cs.CR1
  • quant-ph1
same name
  • F. Morain — 6 papers, h 3
  • F. Morain — 1 paper, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20052018
most citedFast algorithms for computing isogenies between elliptic curves

89 citations · 134 across the 7 of their papers we have counts for

collaborators
Showing 2005 · math.NTShow all

1 paper · 2 filters

math.NT2005

Implementing the asymptotically fast version of the elliptic curve primality proving algorithm

François Morain

The elliptic curve primality proving (ECPP) algorithm is one of the current fastest practical algorithms for proving the primality of large numbers. Its running time cannot be prov…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.