Elliptic Curve Factorization
Elliptic Curve Factorization is a probabilistic integer factorization algorithm that uses the arithmetic of elliptic curves over finite fields to find non-trivial factors of a composite number, particularly effective for integers with small prime factors.
33
Publications
3.6K
Citations
66
Authors
46
Institutions
Publications per year
2017–2026
2
Parents
33
Factoring Integers with Elliptic Curves
H. W. Lenstra · Annals of Mathematics · 1987 · 1K citations
Elliptic curves and primality proving
A. O. L. Atkin, François Morain · Mathematics of Computation · 1993 · 381 citations · Full text
Elliptic Curves and Primality Proving
A. O. L. Atkin, François Morain · Mathematics of Computation · 1993 · 98 citations · Full text
1–5 of 33
66
5
h-index
Institut national de recherche en sciences et technologies du numérique, France
4 publications · 546 citations
4
h-index
4
h-index
2
h-index
École Polytechnique Fédérale de Lausanne, Switzerland
2 publications · 38 citations
2
h-index
1–5 of 66
46
Eindhoven University of Technology
Eindhoven, The Netherlands
2 h-index
3 publications
96 citations
Laboratoire Lorrain de Recherche en Informatique et ses Applications
Nancy, France
2 h-index
3 publications
40 citations
Ruhr University Bochum
Bochum, Germany
2 h-index
2 publications
74 citations
Microsoft (United States)
Redmond, United States
2 h-index
3 publications
113 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
3 publications
49 citations

Direction Générale de l'Armement
Paris, France
2 h-index
4 publications
958 citations
Brown University
Providence, United States
1 h-index
1 publications
12 citations
Tokyo Institute of Technology
Tokyo, Japan
1 h-index
1 publications
14 citations
1–8 of 46
MCOM · 11 publications · 2K citations
11
h-index
2 publications · 75 citations
2
h-index
1 publications · 1K citations
1
h-index
1 publications · 14 citations
1
h-index
1 publications · 16 citations
1
h-index
1–5