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
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2001/098,
      author = {Paulo S.  L.  M.  Barreto and Hae Yong Kim},
      title = {Fast hashing onto elliptic curves over fields of characteristic 3},
      howpublished = {Cryptology ePrint Archive, Paper 2001/098},
      year = {2001},
      note = {\url{https://eprint.iacr.org/2001/098}},
      url = {https://eprint.iacr.org/2001/098}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.