Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences
Binary sequences generated by feedback shift registers with carry operation (FCSR) share many of the important properties enjoyed by sequences generated by linear feedback shift registers. We present an FCSR analog of the (extended) Games-Chan algorithm, which efficiently determines the linear complexity of a periodic binary sequence with period length T = 2(n) or p(n), where p is an odd prime and 2 is a primitive element modulo p(2). The algorithm to be presented yields an upper bound for the 2-adic complexity, an FCSR analog of the linear complexity, of a p(n)-periodic binary sequence. (C) 2002 Elsevier Science B.V. All rights reserved.
games-chan algorithm 2-adic complexity feedback shift register periodic binary sequence stream cipher