[1] D. Boneh and M. Franklin (1999). An efficient public key traitor tracing scheme, Advances in Cryptology - Crypto ’99, Lecture notes in Computer Science 1666, pp. 338–353. <http://crypto.stanford.edu/ adabo/abstracts/traitors.html>.
[2] D. Boneh (1998). The Decision Diffie-Hellman problem, In proc. of the Third Algorithmic Number Theory Symposium (ANTS), Lecture Notes in Computer Science 1423, , pp. 48–63.
[3] B. Chor, Amos Fiat, and Moni Naor (1994). Tracing Traitors, Advances in Cryptology - Crypto ’94, Lecture Notes in Computer Science 839, pp. 257–270.
[4] B. Chor, Amos Fiat, Moni Naor and Benny Pinkas (2000). Tracing Traitors, IEEE Transactions on Information Theory, Vol. 46, no. 3, pp. 893-910.
[5] P. Y. Huang, M. L. Hsieh & K. W. Lan (2000), Generating Elliptic Curve Over Finite Fields, Part I, II.
[6] Jason Q. Chen (2000). A Survey on Traitor Tracing Schemes, MSc. Thesis, University of Waterloo, Canada.
[7] T. K. Meng (2001). Curves for The Elliptic Curve Cryptosystem, M.Sc. Thesis, University of Singapore.
[8] E. Oswald (2002), Introduction to Elliptic Curve Cryptography, Institute for Applied information Processing and Communication A-8010 Inffeldgasse 16a, Graz, Austria.
[9] J. H. Silverman (1986), The Arithmetic of Elliptic Curves, Graduate Text in Mathematics 106, Springer-Verlag.
[10] S.Y. Yan (2000), Number Theory for Computing, Springer-Verlag.