A Complete algorithm for local inversion of maps: Application to Cryptanalysis. (arXiv:2105.07332v2 [cs.CR] UPDATED)

For a map (function) $F(x):\ftwo^n\rightarrow\ftwo^n$ and a given $y$ in the
image of $F$ the problem of \emph{local inversion} of $F$ is to find all
inverse images $x$ in $\ftwo^n$ such that $y=F(x)$. In Cryptology, such a
problem arises in Cryptanalysis of One way Functions (OWFs). The well known
TMTO attack in Cryptanalysis is a probabilistic algorithm for computing one
solution of local inversion using $O(\sqrt N)$ order computation in offline as
well as online for $N=2^n$. This paper proposes …

application local