Integer Factorization

Integer Factorization is the computational problem of decomposing a composite integer into a product of smaller integers, specifically prime factors, which distinguishes it from other arithmetic decomposition tasks by focusing on prime divisibility within number-theoretic algorithms.

418

Publications

32.8K

Citations

802

Authors

387

Institutions

Publications per year

2017–2026

73

Authors

802

  1. PL
    Peter L. Montgomery

    Microsoft (United States), United States

    8 publications · 1.5K citations

    8

    h-index

  2. AK
    Arjen K. Lenstra

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

    8 publications · 177 citations

    8

    h-index

  3. TK
    Thorsten Kleinjung

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

    7 publications · 211 citations

    7

    h-index

  4. CM
    Chandrashekhar Meshram

    Raja Shankar Shah University

    6 publications · 112 citations

    6

    h-index

  5. JL
    J. L. Selfridge

    Northern Illinois University, United States

    5 publications · 138 citations

    5

    h-index

1–5 of 802

Venues

  1. Mathematics of Computation

    MCOM · 50 publications · 3.2K citations

    23

    h-index

  2. Acta Arithmetica

    14 publications · 269 citations

    12

    h-index

  3. Linear Algebra and its Applications

    9 publications · 240 citations

    9

    h-index

  4. Journal of Number Theory

    7 publications · 177 citations

    7

    h-index

  5. arXiv (Cornell University)

    Repository · 7 publications · 368 citations

    7

    h-index

1–5