Constructing pairing-friendly hyperelliptic curves using Weil restriction
A pairing-friendly curve is a curve over a finite field \(\mathbb{F}_q\) whose Jacobian has small embedding degree \(k = [\mathbb{F}_{q}(\zeta_r) ~|~ \mathbb{F}_{q}]\) with respect to a large subgroup of prime order \(r\). Such curves, particularly elliptic curves and, to a lesser extent, genus \(2\) hyperelliptic curves, have a variety of applications in public-key cryptosystems. Supersingular curves are pairing-friendly, but the possible embedding degrees are limited to at most \(12\) for genus \(\leq 2.\) Thus, methods for constructing ordinary curves with small embedding degree have been of particular interest. The goal is to find such curves for which the finite field size is small compared to the \(r,\) measured by the \(\rho\)-value. In this paper, the authors describe a new method for constructing pairing-friendly genus \(2\) hyperelliptic curves over finite fields \(\mathbb{F}_q\) whose Jacobians are ordinary and simple. The main idea is to use existing methods to construct an elliptic curve over \(\mathbb{F}_q\) that becomes pairing friendly over \(\mathbb{F}_q^d,\) and to use the Weil restriction of scalars to find a pairing friendly genus 2 curve over \(\mathbb{F}_q.\) This construction yields curves defined over smaller fields relative to the subgroup size than previous constructions, and hence smaller \(\rho\) values. Using constructions due to Cocks and Pinch [Identity-based cryptosystems based on the Weil pairing (unpublished manuscript) (2001)] and \textit{F. Brezing} and \textit{A. Weng} [``Elliptic curves suitable for pairing based cryptography, Des. Codes Cryptography 37, No. 1, 133--141 (2005; Zbl 1100.14517)] yields curves with generically smaller \(\rho\) values than those obtained from other constructions (\(4\) as opposed to \(8\)), as well as a record value of about \(2.2\) (compared with \(4\)).
- Ordinary pairing-friendly genus 2 hyperelliptic curves with absolutely simple Jacobians
- Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
- Generating more Kawazoe-Takahashi genus 2 pairing-friendly hyperelliptic curves
- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax
- Constructing pairing-friendly genus 2 curves with split Jacobian
- A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- A study on theoretical and practical aspects of Weil-restrictions of varieties
- A taxonomy of pairing-friendly elliptic curves
- Abelian Surfaces over Finite Fields as Jacobians
- Abelian varieties over finite fields
- Abelian Varieties with Prescribed Embedding Degree
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Elliptic Curve Cryptography
- Adèles and algebraic groups. (Appendix 1: The case of the group \(G_2\), by M. Demazure. Appendix 2: A short survey of subsequent research on Tamagawa numbers, by T. Ono)
- Algorithmic Number Theory
- Choosing the correct elliptic curve in the CM method
- Constructing pairing-friendly hyperelliptic curves using Weil restriction
- Curves with infinite K-rational geometric fundamental group
- Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors
- Elliptic Curves and Primality Proving
- Elliptic curves suitable for pairing based cryptography
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Endomorphisms of Abelian varieties over finite fields
- Examples of genus two CM curves defined over the rationals
- Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
- scientific article; zbMATH DE number 706265 (Why is no real title available?)
- scientific article; zbMATH DE number 2081155 (Why is no real title available?)
- scientific article; zbMATH DE number 3995866 (Why is no real title available?)
- scientific article; zbMATH DE number 873401 (Why is no real title available?)
- scientific article; zbMATH DE number 3336595 (Why is no real title available?)
- On the Minimal Embedding Field
- On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields
- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax
- Pairings on Hyperelliptic Curves with a Real Model
- Selected Areas in Cryptography
- The Magma algebra system. I: The user language
- The vector decomposition problem for elliptic and hyperelliptic curves
- Twisting commutative algebraic groups
- Using abelian varieties to improve pairing-based cryptography
- Identity-based undetachable digital signature for mobile agents in electronic commerce
- Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields
- Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree
- Constructing pairing-friendly hyperelliptic curves using Weil restriction
- Constructing pairing-friendly genus 2 curves with split Jacobian
- Parametrizing the moduli space of curves and applications to smooth plane quartics over finite fields
- Hyper-and-elliptic-curve cryptography
- Rational points on certain families of symmetric equations
- A new method for constructing pairing-friendly abelian surfaces
- Generating more Kawazoe-Takahashi genus 2 pairing-friendly hyperelliptic curves
- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax
- Ordinary pairing-friendly genus 2 hyperelliptic curves with absolutely simple Jacobians
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE
- Hyperelliptic curves, Cartier-Manin matrices and Legendre polynomials
- Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
- A new twofold Cornacchia-type algorithm and its applications
- The characteristic polynomials of geometrically split ordinary abelian varieties of dimension 3
- Special TNFS-secure pairings on ordinary genus 2 hyperelliptic curves
This page was built for publication: Constructing pairing-friendly hyperelliptic curves using Weil restriction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2430992)