eprint.iacr.org will be offline for approximately an hour
for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between
April 12 and April 14, and some authors have been notified that they need to resubmit their papers.
You are looking at a specific version 20011115:235413 of this paper.
See the latest version.
Paper 2001/098
Fast hashing onto elliptic curves over fields of characteristic 3
Paulo S. L. M. Barreto and Hae Yong Kim
Abstract
We describe a fast hash algorithm that maps arbitrary messages onto points of an elliptic curve defined over a finite field of characteristic 3. Our new scheme runs in time $O(m^2)$ for curves over $\GF{3^m}$. The best previous algorithm for this task runs in time $O(m^3)$. Experimental data confirms the speedup by a factor $O(m)$, or approximately a hundred times for practical $m$ values. Our results apply for both standard and normal basis representations of $\GF{3^m}$.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- digital signatureselliptic curve cryptosystemhash functions
- Contact author(s)
- pbarreto @ scopus com br
- History
- 2001-11-15: received
- Short URL
- https://ia.cr/2001/098
- License
-
CC BY
