on EE we first study the linear complexity profiles of the sequences f (nG), n= 1, 2,\dots n= 1,
2,⋯ which complements earlier results of Hess and Shparlinski. We use Edwards
coordinates to be able to deal with many f where Hess and Shparlinski's result does not
apply. Moreover, we study the linear complexities of the (generalized) elliptic curve power
generators f (e^ nG) f (en G), n= 1, 2,\dots n= 1, 2,⋯ We present large families of functions f …