Abstract
Due to short operand size, Hyperelliptic Curve Cryptosystem (HECC) of genus 3 is well suited for all kinds of embedded processor architectures, where resources such as storage, time or power are constrained. In the implementation of HECC, a significant step is the selection of secure hyperelliptic curves on which the Jacobian is constructed and speed up the scalar multiplications in the Jacobians of hyperelliptic curves. In this paper, we have explored various possible attacks to the discrete logarithm in the Jacobian of a Hyperelliptic Curve (HEC) that are to be considered to establish a secure HEC, analysed addition and doubling of divisor which are the prime steps of scalar multiplication and then proposed certain improvements in the existing explicit formula that will result in a performance gain for HECC of genus 3.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Menezes, A., Wu, Y., Zuccherato, R.: An elementary introduction to hyperelliptic curves, http://www.cacr.math.uwaterloo.ca/techreports/1997/tech-reports97.html
Koblitz, N.: Hyperelliptic cryptosystems. Journal of Cryptology 1(3), 139–150 (1989)
Cantor, D.G.: Computing in the Jacobian of a hyperelliptic curve. Mathematics of Computation 48, 95–101 (1987)
Gonda, M., Matsuo, K., Kazumaro, A., Chao, J., Tsuji, S.: Improvements of addition algorithm on genus 3 hyperelliptic curves and their implementations. In: Proc. of SCIS 2004, pp. 89–96 (2004)
Pelzl, J., Wollinger, T., Guajardo, J., Paar, C.: Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves, 351–365 (2003), http://eprint.iacr.org/
Fan, X., Wollinger, T., Wang, Y.: Inversion-Free Arithmetic on Genus 3 Hyperelliptic Curves and Its Implementation. In: ITCC 2005, April 4-6, vol. 1, pp. 642–647 (2005)
Fan, X., Wollinger, T., Gong, G.: Efficient explicit formulae for genus 3 hyperelliptic curve cryptosystems over binary fields. IET Inf. Secur. 1(2), 65–81 (2007)
Kuroki, J., Gonda, M., Matsuo, K., Chao, J., Tsujii, S.: Fast Genus Three Hyperelliptic CurveCryptosystems. In: The 2002 Japan — SCIS 2002, pp. 503–507 (2002)
Frey, G., Ruck, H.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Mathematics of Computation 62, 865–874 (1994)
Adleman, L., De Marrais, J., Huang, M.: A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol. 877, pp. 28–40. Springer, Heidelberg (1994)
Ruck, H.G.: On the discrete logarithms in the divisor class group of curves. Mathematics Computation 68, 805–806 (1999)
Smith, B.: Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 163–180. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chatterjee, K., Gupta, D. (2010). Evolution of Hyperelliptic Curve Cryptosystems. In: Janowski, T., Mohanty, H. (eds) Distributed Computing and Internet Technology. ICDCIT 2010. Lecture Notes in Computer Science, vol 5966. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11659-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-11659-9_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11658-2
Online ISBN: 978-3-642-11659-9
eBook Packages: Computer ScienceComputer Science (R0)