Maximum length sequence

Abstract: Two pseudorandom binary sequence generators, based on logistic chaotic maps intended for stream cipher applications, are proposed. The first is based on a single one-dimensional logistic map which exhibits random, noise-like properties at given certain parameter values, and the second is based on a combination of two logistic maps. The encryption step proposed in both algorithms consists of a simple bitwise XOR operation of the plaintext binary sequence with the keystream binary sequence to produce the ciphertext binary sequence. A threshold function is applied to convert the floating-point iterates into binary form. Experimental results show that the produced sequences possess high linear complexity and very good statistical properties. The systems are put forward for security evaluation by the cryptographic committees.

Abstract: The problem of finding binary sequences with autocorrelation sidelobes as small as possible for any given length of the sequence is still unsolved today. However, solutions were found up to length 40 by exhaustive searching with the aid of a special minicomputer.

Abstract: The complexity of a periodic sequence (s) is defined to be the least number of stages in a linear feedback shift register that generates (s)