1. N. Brandstätter, A. Winterhof, Linear complexity profile of binary sequences with small correlation measure. Period. Math. Hung. 52(2), 1–8 (2006)
2. Z. Chen, Elliptic curve analogue of Legendre sequences. Monatsh. Math. 154(1), 1–10 (2008)
3. Z. Chen, G. Xiao, Good pseudo-random binary sequences from elliptic curves (2007), http://eprint.iacr.org/2007/275 . Accessed 7 Sept 2007
4. Z. Chen, S. Li, G. Xiao, Construction of pseudo-random binary sequences from elliptic curves by using discrete logarithm, in Sequences and Their Applications-SETA2006. Lecture Notes in Computer Science, vol. 4086, ed. by G. Gong, T. Helleseth, H.-Y. Song, K. Yang (Springer, Berlin, 2006), pp. 285–294
5. M. Cruz, D. Gómez, D. Sadornil, On the linear complexity of the Naor–Reingold sequence with elliptic curves. Finite Fields Appl. 16(5), 329–333 (2010)