1
$\begingroup$

What is the consequence of factoring and discrete log being in $P/poly$?

$\endgroup$
  • 1
    $\begingroup$ What research have you done? $\endgroup$ – D.W. Nov 23 '15 at 8:22
  • $\begingroup$ The many papers relying on the hardness of factoring or discrete log would become moot and irrelevant. $\endgroup$ – Yuval Filmus Nov 23 '15 at 9:01
1
$\begingroup$

There appear to be pretty much no interesting consequences, from a complexity-theoretic perspective. See Consequences of Factoring being in P? on CSTheory. (Any consequence of factoring being in P/poly would also be a consequence of factoring being in P; but as the answers to that question state, there are basically no known complexity-theoretic consequences to factoring being in P.)

A Google search for "consequences of factoring in P/poly" also turns up Factoring Could be Easy.

| cite | improve this answer | |
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy