# One way permutation and its inverse

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

• 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. Jul 10 '20 at 17:47