Ordinary abelian varieties having small embedding degree

Finite Fields and their Applications

Volumn 13, Issue 4, 2007, Pages 800-814

  Galbraith, S D ^a   McKee, J F ^a   Valenca P C ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Elliptic curves; Pairings

Indexed keywords

GRAPH THEORY; NUMERICAL METHODS; TWO DIMENSIONAL;

ELLIPTIC CURVE; PAIRING;

EMBEDDED SYSTEMS;

EID: 34548662147     PISSN: 10715797     EISSN: 10902465     Source Type: Journal    
DOI: 10.1016/j.ffa.2007.02.003     Document Type: Article

References (19)

1. Balasubramanian R., and Koblitz N. The improbability that an elliptic curve has sub-exponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm. J. Cryptology 11 (1998) 141-145
2. Barreto P.S.L.M., Kim H.Y., Lynn B., and Scott M. Efficient implementation of pairing-based cryptosystems. In: Yung M. (Ed). CRYPTO 2002. Lecture Notes in Comput. Sci. vol. 2442 (2002), Springer, Berlin 354-368
3. Barreto P.S.L.M., Lynn B., and Scott M. Constructing elliptic curves with prescribed embedding degrees. SCN '2002. Lecture Notes in Comput. Sci. vol. 2576 (2002), Springer, Berlin 263-273
4. Barreto P.S.L.M., Galbraith S.D., hÉigeartaigh C.O., and Scott M. Efficient pairing computation on supersingular abelian varieties. Des. Codes Cryptogr. 42 3 (2007) 239-271
5. Blake I.F., Seroussi G., and Smart N.P. Elliptic Curves in Cryptography (2000), Cambridge Univ. Press
6. Bosma W., Cannon J., and Playoust C. The Magma algebra system I: The user language. J. Symbolic Comput. 24 (1997) 235-265
7. Brezing F., and Weng A. Elliptic curves suitable for pairing based cryptography. Des. Codes Cryptogr. 37 1 (2005) 133-141
8. p - x + d. In: Laih C.S. (Ed). ASIACRYPT 2003. Lecture Notes in Comput. Sci. vol. 2894 (2003), Springer, Berlin 111-123
9. Frey G., and Rück H.-G. A remark concerning m-divisibility and the discrete logarithm problem in the divisor class group of curves. Math. Comput. 52 (1994) 865-874
10. Galbraith S.D. Supersingular curves in cryptography. In: Boyd C. (Ed). ASIACRYPT 2001. Lecture Notes in Comput. Sci. vol. 2248 (2001), Springer, Berlin 495-513
11. Galbraith S.D., Harrison K., and Soldera D. Implementing the Tate pairing. In: Fieker C., and Kohel D. (Eds). ANTS-V. Lecture Notes in Comput. Sci. vol. 2369 (2002), Springer, Berlin 324-337
12. Lang S. Algebra. third ed. (1993), Addison-Wesley, Reading, MA
13. Miyaji A., Nakabayashi M., and Takano S. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundamentals E 84 (2001) 1234-1243
14. Rubin K., and Silverberg A. Supersingular abelian varieties in cryptology. In: Yung M. (Ed). CRYPTO 2002. Lecture Notes in Comput. Sci. vol. 2442 (2002), Springer, Berlin 336-353
15. Rück H.-G. Abelian surfaces and Jacobian varieties over finite fields. Compos. Math. 76 (1990) 351-366
16. Scott M., and Barreto P.S.L.M. Generating more MNT elliptic curves. Des. Codes Cryptogr. 38 2 (2006) 209-217
17. E. Scourfield, personal communication
18. Silverman J.H. The Arithmetic of Elliptic Curves. Grad. Texts in Math. vol. 106 (1986), Springer, Berlin
19. Silverman J.H. Advanced Topics in the Arithmetic of Elliptic Curves. Grad. Texts in Math. vol. 151 (1994), Springer, Berlin