Hashing into Hessian curves
by Reza Rezaeian Farashahi
International Journal of Applied Cryptography (IJACT), Vol. 3, No. 2, 2014

Abstract: We propose an encoding function from the elements of the finite field F_q into points on a Hessian curve. Next, we present an injective encoding function from the set of all positive integers less than or equal to l into points on a Hessian curve over F_q with odd q and l = (q - 1)/2. We also present an injective encoding function from the bit strings of length k = 1 into points on a Hessian curve over the binary finite field F_2k.

Online publication date: Sat, 16-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Applied Cryptography (IJACT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com