Four Integer Factorization Algorithms

Details Four Integer Factorization Algorithms Four Integer Factorization Algorithms

2010-03-16

arxiv.org/abs/1003.3261v3

Mathematics

Number Theory

Improvements in Theorem 14, 12 Pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Four Integer Factorization Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Four Integer Factorization Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Four Integer Factorization Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-233260