An efficient algorithm to generate binary sequences for cryptographic purposes

In this work, a simple constructive method is developed for enlarging known families of filtered sequences with given period and large linear complexity. The procedure does not impose any constraint on the number of maximum-order terms in the filter, the order of the filter nor the number of stages in the linear feedback shift register. (C) 2001 Elsevier Science B.V. All rights reserved.