Optimal pairings

IEEE Transactions on Information Theory

Volumn 56, Issue 1, 2010, Pages 455-461

  Vercauteren, Frederik ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Ate pairing; Elliptic curves; Pairing based cryptography; Tate pairing

Indexed keywords

ELLIPTIC CURVE; PAIRING-BASED CRYPTOGRAPHY; TATE PAIRING;

CRYPTOGRAPHY; OPTIMIZATION;

GEOMETRY;

EID: 73849138511     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2034881     Document Type: Article

References (29)

1. R. Avanzi, H. Cohen, C. Doche, G. Frey, T. Lange, K. Nguyen, and F. Vercauteren, Handbook of Elliptic and Hyperelliptic Curve Cryptography. Boca Raton, FL: Chapman and Hall/CRC, 2006, Discrete Mathematics and its Applications (Boca Raton).
2. P. S. L. M. Barreto, S. Galbraith, C. Ó. hÉigeartaigh, and M. Scott, "Efficient pairing computation on supersingular abelian varieties," Designs, Codes Cryptogr., vol. 42, no. 3, pp. 239-271, 2007.
3. P. S. L. M. Barreto, H. Y. Kim, B. Lynn, and M. Scott, "Efficient algorithms for pairing-based cryptosystems," in CRYPTO 2002. New York: Springer, 2002, vol. 2442, Lecture Notes in Computer Science, pp. 354-368.
4. P. S. L. M. Barreto and M. Naehrig, "Pairing-friendly elliptic curves of prime order," in SAC 2005 - Selected Areas in Cryptography. New York: Springer, 2006, vol. 3897, Lecture Notes in Computer Science, pp. 319-331.
5. W. Bosma, J. Cannon, and C. Playoust, "The Magma algebra system. I. The user language," J. Symbolic Comput., vol. 24, no. 3-4, pp. 235-265, 1997.
6. F. Brezing and A. Weng, "Elliptic curves suitable for pairing based cryptography," Designs, Codes Cryptogr., vol. 37, no. 1, pp. 133-141, 2005.
7. P - x + d," in ASIACRYPT 2003. New York: Springer, 2003, vol. 2894, Lecture Notes in Computer Science, pp. 111-123.
8. D. Freeman, "Constructing pairing-friendly elliptic curves with embedding degree 10," in Algorithmic Number Theory Symposium - ANTS-VII, 2006, vol. 4076, Lecture Notes in Computer Science, pp. 452-465.
9. D. Freeman, M. Scott, and E. Teske, "A taxonomy of pairing-friendly elliptic curves," J. Cryptol., 2009, to be published.
10. G. Frey and H.-G. Rück, "A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves," Math. Comp., vol. 62, no. 206, pp. 865-874, 1994.
11. S. D. Galbraith, "Supersingular curves in cryptography," in ASI-ACRYPT 2001. New York: Springer-Verlag, 2002, vol. 2248, Lecture Notes in Computer Science, pp. 495-513.
12. S. D. Galbraith, "Pairings," in Advances in elliptic curve cryptography. Cambridge, U.K.: Cambridge Univ. Press, 2005, vol. 317, London Math. Soc. Lecture Note Ser., pp. 183-213.
13. S. D. Galbraith, K. Harrison, and S. Soldera, "Implementing the Tate pairing," in Proc. Algor. Number Theory Symp.-ANTS V, 2002, vol. 2369, Lecture Notes in Computer Science, pp. 324-337.
14. S. D. Galbraith, F. Hess, and F. Vercauteren, "Hyperelliptic pairings," in Pairing 2007. New York: Springer-Verlag, 2007, vol. 2575, Lecture Notes in Computer Science, pp. 108-131.
15. R. Granger, F. Hess, R. Oyono, N. Thériault, and F. Vercauteren, "Ate pairing on hyperelliptic curves," in EUROCRYPT 2007. New York: Springer-Verlag, 2007, vol. 4515, Lecture Notes in Computer Science, pp. 430-447.
16. F. Hess, "Pairing lattices," in Pairing 2009. : Springer-Verlag, 2009, vol. 5209, Lecture Notes in Computer Science, pp. 18-38.
17. F. Hess, N. Smart, and F. Vercauteren, "The Eta-pairing revisited," IEEE Trans. Inf. Theory, vol. 52, pp. 4595-4602, 2006.
18. E. J. Kachisa, E. F. Schaefer, and M. Scott, Constructing Brezing-Weng Pairing Friendly Elliptic Curves Using Elements in the Cyclotomic Field 2007 [Online]. Available: http://eprint.iacr.org/2007/452, to be published.
19. R. Balasubramanian and N. Koblitz, "The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm," J. Cryptology, vol. 11, no. 2, pp. 141-145, 1998.
20. E. Lee, H.-S. Lee, and C.-M. Park, Efficient and Generalized Pairing Computation on Abelian Varieties 2008 [Online]. Available: http://eprint.iacr. org/2008/040 to be published.
21. S. Matsuda, N. Kanayama, F. Hess, and E. Okamoto, "Optimised versions of the Ate and twisted Ate pairings," in Proc. The 11th IMA Int. Conf. Cryptogr. Coding, 2007, vol. 4887, Lecture Notes in Computer Science, pp. 302-312.
22. V. S. Miller, Short Programs for Functions on Curves 1986 [Online]. Available: http://crypto.stanford.edu/miller/miller.pdf unpublished.
23. V. S. Miller, "The Weil pairing, and its efficient calculation," J. Cryptol., vol. 17, no. 4, pp. 235-261, 2004.
24. H. Minkowski, Geometrie der Zahlen. Leipzig und Berlin: Druck und Verlag von B.G. Teubner, 1910.
25. X. Pujol and D. Stehlé, "Rigorous and efficient short lattice vectors enumeration," in ASIACRYPT 2008. New York: Springer-Verlag, 2008, vol. 5350, Lecture Notes in Computer Science, pp. 390-405.
26. M. Scott, "Faster pairings using an elliptic curve with an efficient endomorphism," in INDOCRYPT 2005. New York: Springer-Verlag, 2005, vol. 3797, Lecture Notes in Computer Science, pp. 258-269.
27. C. Zhao, F. Zhang, and J. Huang, Speeding up the Bilinear Pairings Computation on Curves with Automorphisms 2006 [Online]. Available: http://eprint.iacr.org/2006/474, unpublished.
28. C. Zhao, F. Zhang, and J. Huang, A Note on the Ate Pairing 2007 [Online]. Available: http://eprint.iacr.org/2007/247, to be published.
29. C. Zhao, F. Zhang, and J. Huang, All Pairings are in a Group 2008 [Online]. Available: http://eprint.iacr.org/2008/085, to be published.