Construction of Pairing-Friendly Hyperelliptic Curves Based on the Closed Formulae of the Order of the Jacobian Group

An explicit construction of pairing-friendly hyperelliptic curves with ordinary Jacobians was firstly given by D. Freeman for the genus two case. In this paper, we give an explicit construction of pairing-friendly hyperelliptic curves of genus two and four with ordinary Jacobians based on the closed formulae for the order of the Jacobian of special hyperelliptic curves. For the case of genus two, we prove the closed formula for curves of type y2 = x5 + c. By using the formula, we develop an analogue of the Cocks-Pinch method for curves of type y2 = x5 + c. For the case of genus four, we also develop an analogue of the Cocks-Pinch method for curves of type y2 = x9 + cx. In particular, we construct the first examples of pairing-friendly hyperelliptic curves of genus four with ordinary Jacobians.

[1]  David Mandell Freeman,et al.  Abelian varieties with prescribed embedding degree , 2008, IACR Cryptol. ePrint Arch..

[2]  Matthew K. Franklin,et al.  Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[3]  David Mandell Freeman,et al.  A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties , 2008, Pairing.

[4]  Gabriel Cardona,et al.  Zeta Function and Cryptographic Exponent of Supersingular Curves of Genus 2 , 2007, Pairing.

[5]  Alice Silverberg,et al.  Supersingular Abelian Varieties in Cryptology , 2002, CRYPTO.

[6]  Michael Scott,et al.  A Taxonomy of Pairing-Friendly Elliptic Curves , 2010, Journal of Cryptology.

[7]  Tetsuya Takahashi,et al.  Suitable Curves for Genus-4 HCC over Prime Fields: Point Counting Formulae for Hyperelliptic Curves of Type y2=x2k+1+ax , 2005, ICALP.

[8]  A. Miyaji,et al.  New Explicit Conditions of Elliptic Curve Traces for FR-Reduction , 2001 .

[9]  M. Naehrig,et al.  CM construction of genus 2 curves with p-rank 1 , 2008 .

[10]  Paulo S. L. M. Barreto,et al.  Pairing-Friendly Elliptic Curves of Prime Order , 2005, Selected Areas in Cryptography.

[11]  Tetsuya Takahashi,et al.  Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y2=x5ax , 2008, Pairing.

[12]  Tetsuya Takahashi,et al.  Counting Points for Hyperelliptic Curves of Type y2= x5 + ax over Finite Prime Fields , 2003, Selected Areas in Cryptography.

[13]  Antoine Joux,et al.  A One Round Protocol for Tripartite Diffie–Hellman , 2000, Journal of Cryptology.

[14]  R. Balasubramanian,et al.  The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes—Okamoto—Vanstone Algorithm , 1998, Journal of Cryptology.

[15]  Annegret Weng,et al.  Elliptic Curves Suitable for Pairing Based Cryptography , 2005, Des. Codes Cryptogr..

[16]  Steven D. Galbraith,et al.  Ordinary abelian varieties having small embedding degree , 2007, Finite Fields Their Appl..

[17]  Takakazu Satoh,et al.  Constructing pairing-friendly hyperelliptic curves using Weil restriction , 2011, IACR Cryptol. ePrint Arch..

[18]  David Mandell Freeman,et al.  Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians , 2007, Pairing.