Note Integer Factoring Methods III

Details Note Integer Factoring Methods III Note Integer Factoring Methods III

2007-07-30

arxiv.org/abs/0707.4468v1

Mathematics

Number Theory

20 Pages

Scientific paper

The best deterministic unconditionally proven integer factorization algorithms have exponential running time complexities of O(N^(1/4)) arithmetic operations, and conditional on the Riemann hypothesis, there is a deterministic algorithm of exponential running time complexity O(N^(1/5)). This note proposes a new deterministic integer factorization algorithm of deterministic exponential time complexity O(N^(1/6)). Furthermore, an algorithm for decomposing composite integers that have factor differences of the form q - p = (r - 1)N^(1/2) + u, where r > 1 is a fixed parameter, and | u | < N^(1/3), in deterministic logarithmic time and various other results are included.

Affiliated with

Also associated with

No associations

Rating

Note Integer Factoring Methods III 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 Note Integer Factoring Methods III, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Note Integer Factoring Methods III will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-360242