The most efficient indifferentiable hashing to elliptic curves of \(j\)-invariant 1728 (Q2680379)

The article under review concerns computation for elliptic curves, mainly used in the field of pairing-based cryptography. The author presents a breakthrough within this area which is a new hash function on ordinary elliptic curves \(E_a:y^2=x^3+ax\) over a finite field \(\mathbb{F}_q\) whose \(j\)-invariant equals \(1728\) and satisfies the following interesting properties: \begin{itemize} \item it requires only one exponentiation in finite fields. \item it can be computed in constant time. \item it is provably indifferentiable from a random oracle. \end{itemize} Finally, the present contribution improves the previous fastest random oracles to \(E_a\) which perform two exponentiations in \(\mathbb{F}_q\).