On the elliptic curve endomorphism generator.

For an elliptic curve E<inline-graphic></inline-graphic> over a finite field we define the point sequence (Pn)<inline-graphic></inline-graphic> recursively by Pn=ϑ(Pn-1)=ϑn(P0)<inline-graphic></inline-graphic> with an endomorphism ϑ∈End(E)<inline-graphic></inline-graphic> and with some initial point P0<inline-graphic></inline-graphic> on E<inline-graphic></inline-graphic>. We study the distribution and the linear complexity of sequences obtained from (Pn)<inline-graphic></inline-graphic>. [ABSTRACT FROM AUTHOR]