Indifferentiable hashing to ordinary elliptic F_q -curves of j=0 with the cost of one exponentiation in F_q
On of the most important branches of elliptic curve cryptography is the pairing cryptography, especially in secure multi-party computations. It uses mainly elliptic curves \(E_b : y^2 = x^3+b\) defined over finite fields \(\mbox{F}_q \) of characteristic \(> 3\) whose the \(j\)-invariant is 0, since the pairing computations on them is the most efficient. Many pairing-based protocols (for example, the BLS multi-signature scheme) use a hash function of the form \(H : \{0, 1\}^* \rightarrow E_b(\mbox{F}_q)\). It is desirable that \(H\) is indifferentiable from a random oracle and constant time, that is the computation time of its value is independent of an input argument. All such previously proposed hash functions compute two exponentiations in \(\mbox{F}_q\). In this paper, provided that \(\sqrt{b}\in \mbox{F}_q\) and \(q \not \equiv 1\ (\bmod\ 27)\), a new constant-time hash function \(H : \{0, 1\}^* \rightarrow E_b(\mbox{F}_q)\) indifferentiable from a random oracle is proposed which computes only one exponentiation in \(\mbox{F}_q\). Note that this work essentially improves the ideas of the author presented in [``Efficient indifferentiable hashing to elliptic curves \(y^2 = x^3 + b\) provided that \(b\) is a quadratic residue, Preprint, \url{https://eprint.iacr.org/2020/1070}].
- The most efficient indifferentiable hashing to elliptic curves of \(j\)-invariant 1728
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
- Indifferentiable hashing to Barreto-Naehrig curves
- \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves
- Efficient indifferentiable hashing into ordinary elliptic curves
- Algebraic Function Fields and Codes
- Calculating the Mordell-Weil rank of elliptic threefolds and the cohomology of singular hypersurfaces
- Efficient indifferentiable hashing into ordinary elliptic curves
- Explicit examples of rational and Calabi-Yau threefolds with primitive automorphisms of positive entropy
- Guide to pairing-based cryptography
- How to Hash into Elliptic Curves
- scientific article; zbMATH DE number 2009971 (Why is no real title available?)
- scientific article; zbMATH DE number 7105781 (Why is no real title available?)
- New cube root algorithm based on the third order linear recurrence relations in finite fields
- On the unirationality of higher dimensional Ueno-type manifolds
- Points on elliptic curves over finite fields
- The Arithmetic of Elliptic Curves
- Hashing to elliptic curves of j=0 and Mordell-Weil groups
- The most efficient indifferentiable hashing to elliptic curves of \(j\)-invariant 1728
- Faster hashing to \({\mathbb G}_2\)
- Indifferentiable hashing to Barreto-Naehrig curves
- Hashing to \(\mathbb{G}_2\) on BLS pairing-friendly curves
- Optimal Encodings to Elliptic Curves of \(\boldsymbol{j}\)-Invariants 0, 1728
- Constructing a hash function from plaintext to Huff curves
- \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves
- Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm
- \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves
- Simultaneously simple universal and indifferentiable hashing to elliptic curves
- Batch point compression in the context of advanced pairing-based protocols
- Point (de)compression for elliptic curves over highly 2-adic finite fields
This page was built for publication: Indifferentiable hashing to ordinary elliptic \(\mathbb{F}_{q} \)-curves of \(j=0\) with the cost of one exponentiation in \(\mathbb{F}_{q} \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115746)
