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
Parents
418
Factoring polynomials with rational coefficients
A. K. Lenstra, H. W. Lenstra, László Lovász · Mathematische Annalen · 1982 · 4K citations · Full text
1–5 of 418
802
8
h-index
8
h-index
École Polytechnique Fédérale de Lausanne, Switzerland
7 publications · 211 citations
7
h-index
6
h-index
5
h-index
1–5 of 802
387

University of Waterloo
Waterloo, Canada
11 h-index
17 publications
1.1K citations
University of Southern California
Los Angeles, United States
8 h-index
9 publications
301 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
7 h-index
13 publications
324 citations

Centre National de la Recherche Scientifique
Paris, France
7 h-index
9 publications
344 citations
University of California, Berkeley
Berkeley, United States
5 h-index
10 publications
415 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
5 h-index
9 publications
124 citations

Rashtrasant Tukadoji Maharaj Nagpur University
Nagpur, India
5 h-index
5 publications
100 citations

Hungarian Academy of Sciences
Budapest, Hungary
5 h-index
6 publications
162 citations
1–8 of 387
MCOM · 50 publications · 3.2K citations
23
h-index
14 publications · 269 citations
12
h-index
9 publications · 240 citations
9
h-index
7 publications · 177 citations
7
h-index
Repository · 7 publications · 368 citations
7
h-index
1–5