Cryptology ePrint Archive: Report 2010/529
Generating Pairing-friendly Parameters for the CM Construction of Genus 2 Curves over Prime Fields
Kristin Lauter and Ning Shang
Abstract: We present two contributions in this paper. First, we give a quantitative analysis of the scarcity of pairing-friendly genus 2 curves. This result is an improvement relative to prior work which estimated the density of pairing-friendly genus 2 curves heuristically. Second, we present a method for generating pairing-friendly parameters for which $\rho\approx 8$, where $\rho$ is a measure of efficiency in pairing-based cryptography. This method works by solving a system of equations given in terms of coefficients of the Frobenius element. The algorithm is easy to understand and implement.
Category / Keywords: pairing-friendly, genus 2 curve, prime fields
Date: received 16 Oct 2010, last revised 30 Nov 2010
Contact author: geek at cerias net
Available format(s): PDF | BibTeX Citation
Note: Revised paper incorporating Igor Shparlinski's comments.
Version: 20101201:005849 (All versions of this report)
Short URL: ia.cr/2010/529
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]