Indifferentiable hashing to ordinary elliptic F_q -curves of j=0 with the cost of one exponentiation in F_q
From MaRDI portal
Publication:2115746
Recommendations
- 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
Cites work
- scientific article; zbMATH DE number 2009971 (Why is no real title available?)
- scientific article; zbMATH DE number 7105781 (Why is no real title available?)
- 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
- 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
Cited in
(10)- \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves
- Hashing to \(\mathbb{G}_2\) on BLS pairing-friendly curves
- Indifferentiable hashing to Barreto-Naehrig curves
- Faster hashing to \({\mathbb G}_2\)
- \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves
- The most efficient indifferentiable hashing to elliptic curves of \(j\)-invariant 1728
- Optimal Encodings to Elliptic Curves of \(\boldsymbol{j}\)-Invariants 0, 1728
- Hashing to elliptic curves of \(j=0\) and Mordell-Weil groups
- Constructing a hash function from plaintext to Huff curves
- Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm
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)