MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Compact representation of domain parameters of hyperelliptic curve cryptosystems (2002) [2 citations — 0 self]

Download:
Download as a PDF
by Fangguo Zhang, Shengli Liu, Kwangjo Kim
in ACISP 2002. LNCS
http://caislab.icu.ac.kr/pub/paper_international/../../paper/2002/zhang/ACISP02-zhangkkj.pdf
Add To MetaCart

Abstract:

Abstract. 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 2 41 (It can provide the same level of security with 164 bits ECC) only uses 339 bits. Key words Hyperelliptic curve cryptosystems(HCC), Jacobian, Domain parameters 1

Citations

386 Elliptic curve cryptosystems – Koblitz - 1987
301 Use of elliptic curves in cryptography – Miller - 1985
185 Seminumerical Algorithms – Knuth - 1969
136 A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves – Frey, Ruck - 1994
132 A subexponential algorithm for the discrete logarithm problem with applications to cryptography – Adleman - 1979
102 Computing in the Jacobian of an hyperelliptic curve – Cantor - 1987
58 The Discrete Logarithm Problem on Elliptic Curves of Trace One – Smart - 1997
55 Fermat Quotient and the Polynomial Time Discrete Log Algorithm for Anomalous Elliptic Curves – Satoh, Araki - 1997
46 Counting points on hyperelliptic curves over finite fields – Gaudry, Harley
45 Evaluation of Discrete Logarithms in a Group of p-Torsion Points of an Elliptic Curve in Characteristic p – Semaev - 1998
43 An algorithm for solving the discrete log problem on hyperelliptic curves – Gaudry
34 An Elementary Introduction to Hyperelliptic Curves – Menezes, Wu, et al. - 1998
29 Frobenius maps of abelian varieties and finding roots of unity in finite fields – Pila - 1990
29 Generalized Mersenne Numbers – Solinas - 1999
19 On the Discrete Logarithm in the Divisor Class Group of Curves – Ruck - 1999
16 Counting rational points on curves and Abelian varieties over finite fields – Adleman, Huang
9 On the discriminant of a hyperelliptic curve – Lockhart - 1994
4 Supersingular curves in cryptography,” Asiacrypt 2001 – Galbraith - 2001
3 Hyperelliptic cryptography – Koblitz - 1989
2 Compressed ECC Parameters. Available at http://www.secg.org/collateral/compressed ecc.pdf – Smart
1 descent of Jacobians. Presented at WCC 2001. Available at http://www.cs.bris.ac.uk/ stenve – Galbraith, Weil
1 Canonical Lifting of Elliptic Curves and p-Adic Point Counting – Satoh - 2000
1 Hyperelliptic Supersingular Curves over Fields of Characteristic 2. Available at http://www.math.berkeley.edu/ zhu/preprints.html – Scholten, Zhu
View or Download | Add to My Collection | Correct Errors