Indifferentiable hashing to ordinary elliptic \(\mathbb{F}_{q} \)-curves of \(j=0\) with the cost of one exponentiation in \(\mathbb{F}_{q} \)
DOI10.1007/s10623-022-01012-8zbMath1483.14048OpenAlexW4221113063WikidataQ114849785 ScholiaQ114849785MaRDI QIDQ2115746
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
pairing-based cryptographycubic residue symbol and cubic rootshashing to ordinary elliptic curves of \(j\)-invariant 0indifferentiability from a random oracle
Elliptic curves (14H52) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Calculating the Mordell-Weil rank of elliptic threefolds and the cohomology of singular hypersurfaces
- New cube root algorithm based on the third order linear recurrence relations in finite fields
- 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
- Algebraic Function Fields and Codes
- Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
- The Arithmetic of Elliptic Curves
- Points on elliptic curves over finite fields
- On the unirationality of higher dimensional Ueno-type manifolds
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} \)