Abstract: G. Gong et al introduced a method for generating pseudorandom binary sequences by applying trace functions to supersingular elliptic curves over GF（2^n）, n odd. In this note, a generalized result on the period and the lower bound on linear complexity of s

Key words: Elliptic curves, Pseudorandom sequences, Stream ciphers