Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

Generating pairing-friendly elliptic curves with fixed embedding degrees

  • 88 Accesses

  • 2 Citations

This is a preview of subscription content, log in to check access.


  1. 1

    Brezing F, Weng A. Elliptic curves suitable for pairing based cryptography. Des Codes Cryptogr, 2005, 37: 133–141

  2. 2

    Barreto P S L M, Naehrig M. Pairing-friendly elliptic curves of prime order. In: Proceedings of the 12th International Conference on Selected Areas in Cryptography. Berlin: Springer, 2005. 319–331

  3. 3

    Barreto P S L M, Lynn B, Scott M. Constructing elliptic curves with prescribed embedding degrees. In: Proceedings of the 3rd International Conference on Security in Communication Networks. Berlin: Springer, 2002. 263–273

  4. 4

    Miyaji A, Nakabayashi M, Takano S. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans Fund Electron Commun Comput Sci, 2001, 84: 1234–1243

  5. 5

    Scott M, Barreto P S L M. Generating more MNT elliptic curves. Des Codes Cryptogr, 2006, 38: 209–217

  6. 6

    Pohlig S, Hellman M. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans Inf Theory, 1978, 24: 106–110

  7. 7

    Freeman D, Scott M, Teske E. A taxonomy of pairingfriendly elliptic curves. J Cryptol, 2010, 23: 224–280

Download references

Author information

Correspondence to Liang Li.

Electronic supplementary material

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Li, L. Generating pairing-friendly elliptic curves with fixed embedding degrees. Sci. China Inf. Sci. 60, 119101 (2017). https://doi.org/10.1007/s11432-016-0412-0

Download citation