Year: 2010
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Carella, N. A.
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2135454501
