Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
Martín-Navarro, J. L., Fúster-Sabater, A., & Cardell, S. D. (2021). An innovative linear complexity computation for cryptographic sequences. In Advances in Intelligent Systems and Computing (Vol. 1267 AISC, pp. 339–349). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-57805-3_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
