Four Integer Factorization Algorithms
Number Theory
2010-09-01 v3
Abstract
The theoretical aspects of four integer factorization algorithms are discussed in details in this note. The focus is on the performances of these algorithms on the subset of hard to factor balanced integers N = pq, p < q < 2p. The running time complexity of these algorithms ranges from deterministic exponential time complexity O(N^(1/2)) to heuristic and unconditional logarithmic time complexity O((log N)^c), c > 0 constant.
Cite
@article{arxiv.1003.3261,
title = {Four Integer Factorization Algorithms},
author = {N. A. Carella},
journal= {arXiv preprint arXiv:1003.3261},
year = {2010}
}
Comments
Improvements in Theorem 14, 12 Pages