Is the following statement correct? Let $F$ be a OWP. Then the inverse $F^{-1}$ of $F$ is also a OWP.


In general, unless the OWP also happens to be a trapdoor permutation, there is no way to efficiently evaluate the inverse. So, no.

  • $\begingroup$ Thanks for answering, how can i proof like these statements? $\endgroup$ – stefane Jul 10 '20 at 17:21
  • 1
    $\begingroup$ Well, if the inverse were efficiently publicly computable, then the permutation $F$ would not be one-way. If it were only computable given some kind of additional information then $F$ would be a TDP. $\endgroup$ – Maeher Jul 10 '20 at 17:47

Your Answer

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

Not the answer you're looking for? Browse other questions tagged or ask your own question.