Compact Representation of Domain Parameters of Hyperelliptic Curve Cryptosystems
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.
KeywordsHyperelliptic curve cryptosystems (HCC) Jacobian Domain parameters
Unable to display preview. Download preview PDF.
- 1.L. Adleman, J. De Marrais, M.-D Huang, A Subexponential Algorithm for Discrete Logarithms over the Rational Subgroup of the Jacobians of Large Genus Hyperelliptic Curves over Finite Fields, in ANTS-1, Algorithmic Number Theory, Editors L.M. Adlemand and M-D. Huang, Springer-Verlag, LNCS 877, pp. 28–40, 1994.Google Scholar
- 2.L. Adleman, M.-D Huang, Counting rational points on curves and abelian varieties over finite fields, In ANTS-2:, LNCS 1122, Springer-Verlag, pp. 1–16, 1996.Google Scholar
- 5.S.D. Galbraith, Supersingular curves in cryptography. Available at http://www.cs.bris.ac.uk/stenve
- 6.S.D. Galbraith, Weil descent of Jacobians. Presented at WCC 2001. Available at http://www.cs.bris.ac.uk/stenve.
- 8.P. Gaudry and R. Harley, Counting Points on Hyperelliptic Curves over finite fields. Available at http://www.cs.bris.ac.uk/Tools/Reports/Abstract/2000-gaudry.htm
- 9.D.E. Knuth, and E. Donald E., Seminumerical Algorithms, Addison-Wesley, 1981.Google Scholar
- 11.N. Koblitz, Hyperelliptic cryptography, J.of Crypto., No. 1, pp. 139–150, 1989.Google Scholar
- 13.A. Menezes, Y. Wu, R. Zuccherato, An Elementary Introduction to Hyperelliptic Curves. In: Koblitz, N., Algebraic Aspects of Cryptography, Springer-Verlag Berlin Heidelberg 1998. Available at http://www.cacr.math.uwaterloo.ca/techreports/ 1997/techreports97.html Google Scholar
- 14.V.S. Miller, Use of Elliptic Curve in Cryptography, In Advances in Cryptology-CRYPTO’85 (Santa Barbara,Calif.,1985), LNCS. 218, Spring-Verlag, pp. 417–426, 1986.Google Scholar
- 17.T. Satoh, Canonical Lifting of Elliptic Curves and p-Adic Point Counting-Theoretical Background, Workshop on Elliptic Curve Cryptography-ECC’00, 2000. Available at http://www.exp-math.uni-essen.de/ galbra/eccslides/eccslides.html
- 20.J. Scholten, and Huijun Zhu, Hyperelliptic Supersingular Curves over Fields of Characteristic 2. Available at http://www.math.berkeley.edu/ zhu/preprints.html
- 22.N.P. Smart, Compressed ECC Parameters. Available at http://www.secg.org/collateral/compressed_ecc.pdf
- 23.J.A. Solinas, Generalized Mersenne number, Technical Reports, CACR, Waterloo, 1999. Available at: http://www.cacr.math.uwaterloo.ca/techreports/1999/tech_reports99.html Google Scholar