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

Authors

66

  1. PL
    Peter L. Montgomery

    Microsoft (United States), United States

    5 publications · 1.5K citations

    5

    h-index

  2. FM
    François Morain

    Institut national de recherche en sciences et technologies du numérique, France

    4 publications · 546 citations

    4

    h-index

  3. AO
    A. O. L. Atkin

    University of Illinois Chicago, United States

    4 publications · 546 citations

    4

    h-index

  4. LR
    Lajos Rónyai

    Hungarian Academy of Sciences, Hungary

    2 publications · 29 citations

    2

    h-index

  5. TK
    Thorsten Kleinjung

    École Polytechnique Fédérale de Lausanne, Switzerland

    2 publications · 38 citations

    2

    h-index

1–5 of 66

Venues

  1. Mathematics of Computation

    MCOM · 11 publications · 2K citations

    11

    h-index

  2. Journal of Cryptology

    2 publications · 75 citations

    2

    h-index

  3. Annals of Mathematics

    1 publications · 1K citations

    1

    h-index

  4. IEEE Transactions on Computers

    1 publications · 14 citations

    1

    h-index

  5. SIAM Journal on Discrete Mathematics

    1 publications · 16 citations

    1

    h-index

1–5