Compact representation of domain parameters of hyperelliptic curve cryptosystems

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 203
  • Download : 177
To achieve the same level of security, hyperelliptic curve cryptosystems (HCC) use a smaller field than elliptic curve cryptosystems (ECC). HCC has a more potential application to the product that has limited memory and computing power, for instance Smart cards. We discussed how to represent. the domain parameters of HCC in a compact way. The domain parameters include the field over which the curve is defined, the curve itself, the order of the Jocobian and the base point. In our method, the representation of HCC with genus g=4 over F-241 (It can provide the same level of security with 164 bits ECC) only uses 339 bits.
Publisher
SPRINGER-VERLAG BERLIN
Issue Date
2002-06
Language
English
Article Type
Article; Proceedings Paper
Keywords

DIVISOR CLASS GROUP; DISCRETE LOGARITHM; ELLIPTIC-CURVES; POINTS

Citation

INFORMATION SECURITY AND PRIVACY BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.2384, pp.203 - 213

ISSN
0302-9743
URI
http://hdl.handle.net/10203/17860
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0