International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Hashing into Hessian Curves

Authors:
Reza Rezaeian Farashahi
Download:
URL: http://eprint.iacr.org/2010/373
Search ePrint
Search Google
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$.
BibTeX
@misc{eprint-2010-23274,
  title={Hashing into Hessian Curves},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography / Elliptic curve cryptography, Hessian curve, hashing},
  url={http://eprint.iacr.org/2010/373},
  note={ reza.farashahi@mq.edu.au 14789 received 28 Jun 2010},
  author={Reza Rezaeian Farashahi},
  year=2010
}