### Hashing into Hessian Curves

Reza Rezaeian Farashahi

##### Abstract

We describe a hashing function from the elements of the finite field $\F_q$ 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. Moreover, a point on the image set of the function is uniquely given by its abscissa. For ordinary Hessian curves, the cardinality of the image set of the function is exactly given by $(q+i)/2$ for some $i=1,2,3$.

Available format(s)
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Elliptic curve cryptographyHessian curvehashing
Contact author(s)
reza farashahi @ mq edu au
History
Short URL
https://ia.cr/2010/373

CC BY

BibTeX

@misc{cryptoeprint:2010/373,
author = {Reza Rezaeian Farashahi},
title = {Hashing into Hessian Curves},
howpublished = {Cryptology ePrint Archive, Paper 2010/373},
year = {2010},
note = {\url{https://eprint.iacr.org/2010/373}},
url = {https://eprint.iacr.org/2010/373}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.