Elliptic curves with low embedding degree

Journal of Cryptology

Volumn 19, Issue 4, 2006, Pages 553-562

  Luca, Florian ^a   Shparlinski, Igor E ^b  

^a INSTITUTO DE MATEMÁTICAS   (Mexico)

^b MACQUARIE UNIVERSITY   (Australia)

Author keywords

Elliptic curves; Embedding degree; MNT curves; Pairing

Indexed keywords

ELLIPTIC CURVES; MULTIPLICATION DISCRIMINANTS; PAIRING BASED CRYPTOGRAPHY;

COMPUTATION THEORY; CRYPTOGRAPHY; FINITE ELEMENT METHOD; HEURISTIC METHODS;

EMBEDDED SYSTEMS;

EID: 33749548456     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-006-0544-0     Document Type: Article

References (26)

1. R. Avanzi, H. Cohen, C. Doche, G. Frey, T. Lange, K. Nguyen and F. Vercauteren, Elliptic and Hyperelliptic Curve Cryptography: Theory and Practice, CRC Press, Boca Raton, FL, 2005.
2. R. Balasubramanian and N. Koblitz, The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm, J. Cryptology, 11 (1998), 141-145.
3. P. S. L. M. Barreto, B. Lynn and M. Scott, Elliptic curves with prescribed embedding degrees, Lecture Notes in Computer Science, vol. 3006, Springer-Verlag, Berlin, 2003, pp. 17-25.
4. P. S. L. M. Barreto, B. Lynn and M. Scott, Efficient implementation of pairing-based cryptosystems, J. Cryptology, 17 (2004), 297-319.
5. P. S. L. M. Barreto and M. Naehrig, Pairing-friendly elliptic curves of prime order, Selected Areas in Cryptography, SAC '2005, Springer-Verlag, Berlin (to appear).
6. I. Blake, G. Seroussi and N. Smart, Elliptic Curves in Cryptography, London Mathematical Society, Lecture Note Series, vol. 265, Cambridge University Press, Cambridge, 1999.
7. I. Blake, G. Seroussi and N. Smart, Advances in Elliptic Curves in Cryptography, London Mathematical Society, Lecture Note Series, vol. 317, Cambridge University Press, Cambridge, 2005.
8. D. Boneh and M. Franklin, Identity-based encryption from the Weil pairing, SIAM J. Comput., 32 (2003), 586-615.
9. D. Boneh, B. Lynn and H. Shacham, Short signatures from the Weil pairing, J. Cryptology, 17 (2004), 297-319.
10. Z. I. Borevich and I. R. Shafarevich, Number Theory, Academic Press, New York, 1966.
11. F. Brezing and A. Weng, Elliptic curves suitable for pairing based cryptography, Des. Codes Cryptogr., 37 (2005), 133-141.
12. W. Duke, J. B. Friedlander and H. Iwaniec, Equidistribution of roots of a quadratic congruence to prime moduli, Ann. of Math., 141 (1995), 423-441.
13. R. Dupont, A. Enge and A. Morain, Building curves with arbitrary small MOV degree over finite prime fields, J. Cryptology, 18 (2005), 79-89.
14. S. D. Galbraith, J. McKee and P. Valenca, Ordinary abelian varieties having small embedding degree, Proc. Workshop on Mathematical Problems and Techniques in Cryptology, CRM, Barcelona, 2005, pp. 29-45.
15. A. Joux, A one round protocol for tripartite Diffie-Hellman, Lecture Notes in Computer Science, Springer-Verlag, Berlin, vol. 1838, 2000, pp. 385-393.
16. A. Joux, The Weil and Tate pairings as building blocks for public key cryptosystems, Lecture Notes in Computer Science, Springer-Verlag, Berlin, vol. 2369, 2002, pp. 20-32.
17. H. W. Lenstra Jr., Solving the Pell equation, Notices Amer. Math. Soc., 49 (2002), 182-192.
18. F. Luca, D. J. Mireles and I. E. Shparlinski, MOV attack in various subgroups on elliptic curves, Illinois J. Math., 48 (2004), 1041-1052.
19. F. Luca and I.E. Shparlinski, On the exponent of the group of points on elliptic curves in extension fields, Intern. Math. Res. Not., 2005 (2005), 1391-1409.
20. A. Miyaji, M. Nakabayashi and S. Takano, New explicit conditions of elliptic curve traces for FR-reduction, IEICE Trans. Fundamentals, E84-A (2001), 1234-1243.
21. K. Rubin and A. Silverberg, Supersingular abelian varieties in cryptology, Lecture Notes in Computer Science, Springer-Verlag, Berlin, vol. 2442, 2002, pp. 336-353.
22. R. Sakai, K. Ohgishi and M. Kasahara, Cryptosystems based on pairing, Proc. SCIS 2000, Okinawa, 2000.
23. M. Scott and P. S. L. M. Barreto, Generating more MNT elliptic curves, Des. Codes Cryptogr., 38 (2006), 209-217.
24. J. H. Silverman, The Arithmetic of Elliptic Curves, Springer-Verlag, Berlin, 1995.
25. G. Tenenbaum, Introduction to Analytic and Probabilistic Number Theory, Cambridge University Press, Cambridge, 1995.
26. E. R. Verheul, Evidence that XTR is more secure than supersingular elliptic curve cryptosystems, Lecture Notes in Computer Science, Springer-Verlag, Berlin, vol. 2045, 2001, pp. 195-210.