New Binary Sequences of Period pq with Low Values of Correlation and Large Linear Complexity

Many new binary sequences are obtained from Jacobi sequences with arbitrary starting points and investigated from the cryptographic viewpoint. Autocorrelation values of these new sequences and cross-correlation values between of them are calculated. The results show that these values may be very low and distributed flatly under certain conditions. Linear complexity of them can be proved always lager than the half of their least positive integer period. So the key streams gotten from them can prevent correlation attacks and B-M algorithm.