In many aspects, cryptanalyses of pairing based cryptography consider protocol level security and take difficulties of primitives
for granted. In this survey, we consider pairing inversion. At the time this manuscript was written(April 2007), to the best
of the author’s knowledge, there are neither known feasible algorithms for pairing inversions nor published proofs that the
problem is unfeasible.
Keywords elliptic curves - pairing based cryptography - complexity