Welcome to the resource topic for 2025/1926
Title:
Hashing-friendly elliptic curves
Authors: Dimitri Koshelev
Abstract:This article aims to consider batch hashing to elliptic curves. The given kind of hash functions found numerous applications in elliptic curve cryptography. In practice, a hash-to-curve function is often evaluated at a time by the same entity at many different inputs. It turns out that under certain mild conditions simultaneous evaluation can be carried out several times faster than separate ones. In this regard, the article introduces a new class of elliptic curves over finite fields, more appropriate for multiple hashing to them. Moreover, two explicit hashing-friendly Montgomery/twisted Edwards curves (of \approx 128 security bits) have been generated: one of CM discriminant -7, i.e., a GLV-friendly curve and one of huge CM discriminant, i.e., a CM-secure curve. The new elliptic curves are intentionally covered by so-called Klein’s and Bring’s curves of geometric genera 3 and 4, respectively. The latter are well studied in various algebraic geometry contexts, although they have not yet been (reasonably) applied in cryptography to the author’s knowledge. Such a mathematical complication is justified, since conventional curves (from existing standards or of j-invariants 0, 1728) are seemingly less efficient for batch hashing.
ePrint: https://eprint.iacr.org/2025/1926
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .