We introduce a new type of sequences using the sum of coefficients of characteristic polynomials for elements (in particular, primitive elements) in a finite field. These sequences are nonlinear filtering sequences of the well-known m-sequences. We show that they have large linear complexity and large period. We also provide some examples of such binary sequences with good autocorrelation values.

Additional Metadata
Keywords Correlation, Linear complexity, Maximum period, Nonlinearly filtered LFSR sequences
Persistent URL dx.doi.org/10.1007/s12095-017-0256-3
Journal Cryptography and Communications
Citation
Tuxanidy, A. (Aleksandr), & Wang, Q. (2018). Characteristic digit-sum sequences. Cryptography and Communications, 10(4), 705–717. doi:10.1007/s12095-017-0256-3