Indifferentiable hashing to ordinary elliptic F_q -curves of j=0 with the cost of one exponentiation in F_q
DOI10.1007/S10623-022-01012-8zbMATH Open1483.14048OpenAlexW4221113063WikidataQ114849785 ScholiaQ114849785MaRDI QIDQ2115746FDOQ2115746
Publication date: 21 March 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01012-8
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
pairing-based cryptographycubic residue symbol and cubic rootshashing to ordinary elliptic curves of \(j\)-invariant 0indifferentiability from a random oracle
Applications to coding theory and cryptography of arithmetic geometry (14G50) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Elliptic curves (14H52)
Cites Work
- Algebraic Function Fields and Codes
- The Arithmetic of Elliptic Curves
- Title not available (Why is that?)
- Calculating the Mordell-Weil rank of elliptic threefolds and the cohomology of singular hypersurfaces
- Explicit examples of rational and Calabi-Yau threefolds with primitive automorphisms of positive entropy
- How to Hash into Elliptic Curves
- Efficient indifferentiable hashing into ordinary elliptic curves
- Points on elliptic curves over finite fields
- Title not available (Why is that?)
- Guide to pairing-based cryptography
- On the unirationality of higher dimensional Ueno-type manifolds
- New cube root algorithm based on the third order linear recurrence relations in finite fields
Cited In (5)
- \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
- Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm
- \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves
- Optimal Encodings to Elliptic Curves of \(\boldsymbol{j}\)-Invariants 0, 1728
Uses Software
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)
