If P==NP how to solve the Prime Factorization problem?

Hello All,

I am looking for information on "if a polynomial time algorithm exists
for any NP-Complete problem how to use to solve the prime
factorization problem"

I have read everywhere that if it turns out that P==NP then prime
factorization ends up in P. But no where any algorithm is mentioned to
solve Prime factorization in Polynomial time if we know an algorithm
for any other NP-Complete problem (running in polynomial time).

Simply I am looking for more information on reductions between Prime
factorization and other NP-Complete problems.

Any information/links/algorithm are highly appreciated.

Thank you.

.

Relevant Pages

  • Re: Aspiring highest-order programmer
    ... > that today's programmers repeat the mistakes of the past because their ... not the algorithm choosen to solve it. ... it means that there is no known polynomial time algorithm to ... algorithm to solve any NP-complete problem, ...
    (comp.programming)
  • Re: If P==NP how to solve the Prime Factorization problem?
    ... factorization ends up in P. ... But no where any algorithm is mentioned to ... for any other NP-Complete problem. ... you just do a binary search ...
    (comp.theory)
  • Re: If P==NP how to solve the Prime Factorization problem?
    ... factorization ends up in P. ... But no where any algorithm is mentioned to ... for any other NP-Complete problem. ... you just do a binary search ...
    (comp.theory)
  • Re: If P==NP how to solve the Prime Factorization problem?
    ... I am looking for information on "if a polynomial time algorithm exists ... factorization ends up in P. ... for any other NP-Complete problem. ... you just do a binary search ...
    (comp.theory)
  • Re: Oracles
    ... very fact that an oracle makes an NP problem solvable in P indicates ... in polynomial time (ie. time bounded by a polynomial ... multiplication (using a "fast" algorithm). ... an NP-complete problem, ...
    (sci.math)