1. Avanzi R., Cohen H., Doche C., Frey G., Lange T., Nguyen K., Vercauteren F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography, Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, Boca Raton, FL (2006)
2. Balasubramanian R., Koblitz N.: The improbability that an elliptic curve has sub-exponential discrete log problem under the Menezes–Okamoto–Vanstone algorithm. J. Cryptol. 11(2), 141–145 (1998)
3. Barreto P.S.L.M., Galbraith S., ÓhÉigeartaigh C., Scott M.: Efficient pairing computation on supersingular Abelian varieties. Des. Codes Cryptogr. 42(3), 239–271 (2007)
4. Barreto P.S.L.M., Kim H.Y., Lynn B., Scott M.: Efficient algorithms for pairing-based cryptosystems. In: Proceedings of Advances in Cryptology-Crypto 2002. Lecture Notes in Computer Science, vol. 2442, pp. 354–368. Springer-Verlag, Heidelberg (2002).
5. Bosma W., Cannon J., Playoust C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24(3), 235–265 (1997). http://magma.maths.usyd.edu.au/ .