A simple algorithm to compute the linear complexity of binary sequences with period a power of 2 has been proposed. The algorithm exploits the fractal structure of the binomial representation in this kind of binary sequences. The application of the general algorithm to a particular family of cryptographic sequences (generalized sequences) improves its performance as decreases the amount of sequence to be processed. .
Recommended citation: Martín-Navarro J.L., Fúster-Sabater A., Cardell S.D. (2021) An Innovative Linear Complexity Computation for Cryptographic Sequences. 13th International Conference on Computational Intelligence in Security for Information Systems (CISIS 2020). Advances in Intelligent Systems and Computing, vol 1267. Springer. https://doi.org/10.1007/978-3-030-57805-3_32