In pairing-based cryptography, it is necessary to choose an elliptic curve with a small embedding degree and a large prime-order subgroup, which is called a pairing-friendly curve. In this paper, we study the number of the pairing-friendly curves with a given large prime-order subgroup.
|Number of pages||5|
|Journal||International Journal of Pure and Applied Mathematics|
|Publication status||Published - May 28 2012|
All Science Journal Classification (ASJC) codes
- Applied Mathematics