Sequences and their applications

Más información sobre el libro

The content includes a variety of invited papers discussing topics related to sequences and their complexities. Key areas explored are shift register sequences, linear complexity of multisequences, and the applications of multi-continued fraction algorithms. The analysis of linear complexity over various fields, including bounds on linear complexity for Sidel’nikov sequences, is also covered. Additionally, the correlation properties of binary sequences and their ideal autocorrelation characteristics are examined. The text delves into stream ciphers, focusing on the security of jump-controlled sequence generators and enhancements to Rijndael-like S-boxes. It further addresses nonlinear complexities of binary sequences, connections to Lempel-Ziv compression, and the computation of k-error N-adic complexities. The classification of periodic binary sequences into nonlinear complexity classes is discussed alongside new algorithms for computing terms in characteristic sequences. The implementation of multi-continued fraction algorithms for multi-sequence synthesis is highlighted, as well as the study of pseudo-random binary sequences derived from elliptic curves. The document also touches on the periodicity and distribution properties of combined FCSR sequences, aperiodic correlation, and generalized bounds on partial aperiodic correlation. Lastly, it examines boolean functions, their immunity profiles, and methods for constru