Note on Integer Factoring Algorithms II

Details Note on Integer Factoring Algorithms II Note on Integer Factoring Algorithms II

2007-02-08

arxiv.org/abs/math/0702227v1

Mathematics

Number Theory

23 Pages

Scientific paper

This note introduces a new class of integer factoring algorithms. Two
versions of this method will be described, deterministic and probabilistic.
These algorithms are practical, and can factor large classes of balanced
integers N = pq, p < q < 2p in superpolynomial time. Further, an extension of
the Fermat factoring method is proposed.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-433132