2010
DOI: 10.1007/978-3-642-17455-1_17
|View full text |Cite
|
Sign up to set email alerts
|

Deterministic Encoding and Hashing to Odd Hyperelliptic Curves

Abstract: Abstract. In this paper we propose a very simple and efficient encoding function from Fq to points of a hyperelliptic curve over Fq of the form H :where f is an odd polynomial. Hyperelliptic curves of this type have been frequently considered in the literature to obtain Jacobians of good order and pairing-friendly curves.Our new encoding is nearly a bijection to the set of Fq-rational points on H. This makes it easy to construct well-behaved hash functions to the Jacobian J of H, as well as injective maps to J… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
26
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 24 publications
(26 citation statements)
references
References 25 publications
0
26
0
Order By: Relevance
“…A number of highly relevant cryptographic constructions, including identity based schemes [8] and password based key exchange protocols [7], require hashing into elliptic curves. Indeed, there have been a number of proposals for such hash functions, see for instance [17,21,27]. Recently, Farashahi et al [15] developed powerful techniques to show the indifferentiability of hash function constructions based on deterministic encodings.…”
Section: Application To Elliptic Curvesmentioning
confidence: 99%
“…A number of highly relevant cryptographic constructions, including identity based schemes [8] and password based key exchange protocols [7], require hashing into elliptic curves. Indeed, there have been a number of proposals for such hash functions, see for instance [17,21,27]. Recently, Farashahi et al [15] developed powerful techniques to show the indifferentiability of hash function constructions based on deterministic encodings.…”
Section: Application To Elliptic Curvesmentioning
confidence: 99%
“…the point at infinity and those of the form (x, 0)), and T ⊂ F q the set of roots of f in F q . In [9], we proved:…”
Section: Theorem 1 If P Is Large Enough the Expected Number Of Itermentioning
confidence: 99%
“…We can thus use the results of [9] to obtain an "almost bijective" map F q → H 0 (F q ), as well as a ν − O(1) -injective encoding to the Jacobian of H 0 . Therefore, we concentrate on the case when g is even, which we study in more details from now.…”
Section: 3mentioning
confidence: 99%
See 2 more Smart Citations