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
Parents
218
1–5 of 218
320
6
h-index
6
h-index
5
h-index
5
h-index
4
h-index
1–5 of 320
186

Newcastle University
Newcastle upon Tyne, United Kingdom
5 h-index
15 publications
231 citations

Macquarie University
Sydney, Australia
4 h-index
4 publications
116 citations
University of California, Berkeley
Berkeley, United States
4 h-index
9 publications
519 citations
Universities UK
London, United Kingdom
4 h-index
13 publications
193 citations
University of Oxford
Oxford, United Kingdom
4 h-index
3 publications
108 citations

Reed College
Portland, United States
4 h-index
12 publications
377 citations
Johann Radon Institute for Computational and Applied Mathematics
Linz, Austria
3 h-index
3 publications
81 citations

Rice University
Houston, United States
3 h-index
6 publications
1.4K citations
1–8 of 186
MCOM · 29 publications · 1.9K citations
16
h-index
8 publications · 184 citations
8
h-index
6 publications · 503 citations
6
h-index
PROC · 6 publications · 222 citations
6
h-index
5 publications · 109 citations
5
h-index
1–5