Back to Search
Start Over
The most efficient indifferentiable hashing to elliptic curves of j-invariant 1728
- Source :
- Journal of Mathematical Cryptology, Vol 16, Iss 1, Pp 298-309 (2022)
- Publication Year :
- 2022
- Publisher :
- De Gruyter, 2022.
-
Abstract
- This article makes an important contribution to solving the long-standing problem of whether all elliptic curves can be equipped with a hash function (indifferentiable from a random oracle) whose running time amounts to one exponentiation in the basic finite field Fq{{\mathbb{F}}}_{q}. More precisely, we construct a new indifferentiable hash function to any ordinary elliptic Fq{{\mathbb{F}}}_{q}-curve Ea{E}_{a} of j-invariant 1728 with the cost of extracting one quartic root in Fq{{\mathbb{F}}}_{q}. As is known, the latter operation is equivalent to one exponentiation in finite fields with which we deal in practice. In comparison, the previous fastest random oracles to Ea{E}_{a} require to perform two exponentiations in Fq{{\mathbb{F}}}_{q}. Since it is highly unlikely that there is a hash function to an elliptic curve without any exponentiations at all (even if it is supersingular), the new result seems to be unimprovable.
Details
- Language :
- English
- ISSN :
- 18622984 and 20210051
- Volume :
- 16
- Issue :
- 1
- Database :
- Directory of Open Access Journals
- Journal :
- Journal of Mathematical Cryptology
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.9fac2a9b5f584aab925b7ace37e8ff08
- Document Type :
- article
- Full Text :
- https://doi.org/10.1515/jmc-2021-0051