Faster deterministic integer factorization

Details Faster deterministic integer factorization Faster deterministic integer factorization

2012-01-10

arxiv.org/abs/1201.2116v1

Mathematics

Number Theory

7 pages

Scientific paper

The best known unconditional deterministic complexity bound for computing the
prime factorization of an integer N is O(M_int(N^(1/4) log N)), where M_int(k)
denotes the cost of multiplying k-bit integers. This result is due to
Bostan--Gaudry--Schost, following the Pollard--Strassen approach. We show that
this bound can be improved by a factor of (log log N)^(1/2).

Affiliated with

Also associated with

No associations

Rating

Faster deterministic integer factorization 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 Faster deterministic integer factorization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Faster deterministic integer factorization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-463471