Fermat Factorization

Fermat Factorization is a deterministic integer factorization algorithm that exploits the representation of an odd composite number as the difference of two squares to efficiently find its non-trivial factors.

218

Publications

7.8K

Citations

320

Authors

186

Institutions

Publications per year

2017–2026

24

Authors

320

  1. RM
    Raphael M. Robinson

    University of California, Berkeley, United States

    6 publications · 192 citations

    6

    h-index

  2. HS
    H. S. Vandiver

    University of Illinois Urbana-Champaign, United States

    6 publications · 148 citations

    6

    h-index

  3. AH
    A.G.J. Holt

    Newcastle University, United Kingdom

    5 publications · 79 citations

    5

    h-index

  4. RE
    Richard E. Crandall

    Reed College, United States

    5 publications · 178 citations

    5

    h-index

  5. JB
    John Brillhart

    University of Arizona, United States

    4 publications · 301 citations

    4

    h-index

1–5 of 320

Venues

  1. Mathematics of Computation

    MCOM · 29 publications · 1.9K citations

    16

    h-index

  2. American Mathematical Monthly

    8 publications · 184 citations

    8

    h-index

  3. 6

    h-index

  4. Proceedings of the American Mathematical Society

    PROC · 6 publications · 222 citations

    6

    h-index

  5. Bulletin of the American Mathematical Society

    5 publications · 109 citations

    5

    h-index

1–5