Atkin, A.O.L., Morain, F.: Elliptic Curves and Primality Proving. Mathematics of Computation 61, 29-68 (1993)
Barreto, P.S.L.M., Naehrig, M.: Pairing-Friendly Elliptic Curves of Prime Order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319-331. Springer, Heidelberg (2006)
Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. SI AM Journal of Computing 32(3), 586-615 (2003)
Brezing, F., Weng, A.: Elliptic Curves Suitable for Pairing Based Cryptography. Designs, Codes and Cryptography 37, 133-141 (2005)
Drylo, R.: On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant. In: Bernstein, D.J., Chatterjee, S. (eds.) INDOCRYPT 2011. LNCS, vol. 7107, pp. 310-319. Springer, Heidelberg (2011)
Duan, P., Cui, S., Chan, C.W.: Finding More Non-Supersingular Elliptic Curves for Pairing-Based Cryptosystems. International Journal of Information Technology 2(2), 157-163 (2005)
Fotiadis, G., Konstantinou, E.: On the Efficient Generation of Generalized MNT Elliptic Curves. In: Muntean, T., Poulakis, D., Rolland, R. (eds.) CAI 2013. LNCS, vol. 8080, pp. 147-159. Springer, Heidelberg (2013)
Freeman, D.: Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 452-465. Springer, Heidelberg (2006)
Freeman, D., Scott, M., Teske, E.: A Taxonomy of Pairing-Friendly Elliptic Curves. Journal of Cryptology 23, 224-280 (2010)
Galbraith, S.D., McKee, J., Valenca, P.: Ordinary Abelian Varieties Having Small Embedding Degree. Finite Fields and Their Applications 13(4), 800-814 (2007)
Joux, A.: A One Round Protocol for Tripartite Diffie-Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 385-394. Springer, Heidelberg (2000)
Kachisa, E.J., Schaefer, E.F., Scott, M.: Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 126-135. Springer, Heidelberg (2008)
Lee, H.-S., Park, C.-M.: Generating Pairing-Friendly Curves with the CM Equation of Degree 1. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 66-77. Springer, Heidelberg (2009)
Miyaji, A., Nakabayashi, M., Takano, S.: New Explicit Conditions of Elliptic Curve Traces for FR-Reduction. IEICE Transactions Fundamentals E84-A(5), 1234-1243 (2001)
Mollin, R.A.: Fundamental Number Theory with Applications. CRC Press, Boca Raton (1998)
Mollin, R.A.: Simple Continued Fraction Solutions for Diophantine Equations. Ex-positines Mathematicae 19, 55-73 (2001)
Murphy, A., Fitzpatrick, N.: Elliptic Curves for Pairing Applications. IACR Eprint archive (2005), http://eprint.iacr.org/2005/302/
Scott, M., Barreto, P.S.L.M.: Generating more MNT Elliptic Curves. Designs, Codes and Cryptography 38, 209-217 (2006)
Tanaka, S., Nakamula, K.: Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 136-145. Springer, Heidelberg (2008)