Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/151255
19 Visitors
24 Hits
0 Downloads
- Title
- Hashing into Hessian curves
- Related
- International Conference on Cryptology in Africa (4th : 2011) (5 - 7 July 2011 : Dakar, Senegal)
- Related
- Nitaj, Abderrahmane and Pointcheval, David. Progress in cryptology - AfricaCrypt 2011 : 4th International Conference on Cryptology in Africa, Dakar, Senegal, July 5-7, 2011 : proceedings, p.278-289
- DOI
- 10.1007/978-3-642-21969-6_17
- Related
- Lecture notes in computer science Vol. 6737
- Publisher
- Heidelberg, Germany : Springer
- Date
- 2011
- Author/Creator
- Rezaeian Farashahi, Reza
- Description
- We describe a hashing function from the elements of the finite field double-struck Fq into points on a Hessian curve. Our function features the uniform and smaller size for the cardinalities of almost all fibers compared with the other known hashing functions for elliptic curves. For ordinary Hessian curves, this function is 2:1 for almost all points. More precisely, for odd q, the cardinality of the image set of the function is exactly given by (q + i + 2)/2 for some i = - 1,1. Next, we present an injective hashing function from the elements of ℤm into points on a Hessian curve over double-struck Fq with odd q and m = (q + i)/2 for some i = - 1,1,3.
- Description
- 12 page(s)
- Subject Keyword
- elliptic curve cryptography
- Subject Keyword
- hashing
- Subject Keyword
- Hessian curve
- Resource Type
- conference paper
- Organisation
- Macquarie University. Dept. of Computing
- Identifier
- http://hdl.handle.net/1959.14/151255
- Identifier
- ISBN:9783642219689
- Identifier
- ISSN:0302-9743
- Identifier
- mq_res-ext-2-s2.0-79960085090
- Language
- eng
- Reviewed
