Let Show that MODEXP P. (Note that the most obvious algorithm doesnt run in polynomial time.

Question:

Let

MODEXP = {(a, b, c, p)| a, b, c, and p are positive binary integers such that a =c (mod p)}.


Show that MODEXP ∈ P. (Note that the most obvious algorithm doesn’t run in polynomial time. Try it first where b is a power of 2.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: