Further results on pseudorandom binary sequences derived from Fermat-Euler Quotients

For an odd prime p and a positive integer r, new classes of p^r+1-periodic binary sequences derived from Euler quotients with more flexible support set are proposed in [Ye, et al., Some Notes on Pseudorandom Binary Sequences Derived from Fermat-Euler Quotients, IEICE Trans. on Fundamentals, to be published, 2015]. However, the linear complexities of new sequences are only determined with some constrains on the supporting set. This paper studies the linear complexities of above sequences in a more general case, and an algorithm is then presented. By our proposed method, the linear complexities of above sequences under the assumption of 2^p-1≠1 mod p² and with arbitrary supporting sets could be determined.