References
- Blake, I. F., V. Kumar Murty, and G. Xu. 2006. Refinements of Miller's Algorithm for Computing the Weil/Tate Pairing, Journal of Algorithms, 58:134–149.
- Boneh, D. and M. Franklin. 2001. Identity-based Encryption from the Weil Pairing, CRYPTO '01, Lecture Notes in Computer Science, Springer-Verlag, 2139: 213–229.
- Boneh, D. and H. Shacham 2004. Group signatures with verifier-local revocation, ACM Conference on Computer and Communications Security—CCS 2004, 25–26 October, New York, NY, USA, 168–177.
- Chatterjee, S., P. Sarkar, and R. Barua. 2005. Efficient computation of Tate Pairing in Projective Coordinate over General Characteristic Fields, Information Security and Cryptology—ICISC 2004, 2–3 December, 257–283.
- Cheng, Z. and M. Nistazakis. April 2005. Implementing Pairing-based Cryptosystems, International Workshop on Wireless Security Technologies—IWWST05, 4–5 April, London, U.K.
- Costello, C., H. Hisil, C. Boyd, J. Gonzalez Nieto, and K. Wong. 2009. Faster Pairings on Special Weierstrass Curves, Pairing-Based Cryptography - Pairing 2009, 89–101.
- Frey, G. and H. G. Rück. 1994. A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves, Mathematics of Computation, 62:865–874.
- Galbraith, S., K. Harrison, and D. Soldera. 2002. Implementing the Tate Pairing, Algorithmic Number Theory, 69–86.
- Hess, F., N. P. Smart, and F. Vercauteren. 2006. The Eta Pairing Revisited, Information Theory, IEEE Transactions on, 52:4595–4602.
- Ionica, S. and A. Joux. 2008. Another Approach to Pairing Computation in Edwards Coordinates, INDOCRYPT 2008, 400–413.
- Joux, A. 2000. A one round protocol for Tripartite Diffie-Hellman, Algorithmic Number Theory, 385–393.
- Joux A. 2002. The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems, Algorithmic Number Theory, 11–18.
- Joye, M., M. Tibouchi, and D. Vergnaud. 2010. Huffs Model for Elliptic Curves, Algorithmic Number Theory, 234–250.
- Miller, V. S. 1986. Short Programs for Functions on Curves, Unpublished manuscript. http://crypto.stanford.edu/miller/miller.ps
- Miller, V. S. 2004. The Weil Pairing, and its Efficient Calculation, Journal of Cryptology, 17:235–261.
- Vercauteren, F. 2010. Optimal Pairings, Information Theory, IEEE Transactions on, 56:455–461.
- Xu, L. and D. Lin. 2010. Refinement of Miller's Algorithm Over Edwards Curves, Topics in Cryptology-CT-RSA 2010, 106–118.