Alecu, A. and Salagean, A. (2007) Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences. In: Galbraith, S.D., Ed., Cryptography and Coding. Cryptography and Coding 2007. Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 220-232.
https://doi.org/10.1007/978-3-540-77272-9_14

has been cited by the following article:

• TITLE: Multi-Value Sequence Generated over Sub Extension Field and Its Properties

  AUTHORS: Md. Arshad Ali, Yuta Kodera, Takuya Kusaka, Satoshi Uehara, Yasuyuki Nogami, Robert H. Morelos-Zaragoza

  KEYWORDS: Pseudo-Random Sequence, Trace Function, Power Residue Symbol, Sub Extension Field, Autocorrelation, Cross-Correlation, Linear Complexity, Distribution of Bit Patterns

  JOURNAL NAME: Journal of Information Security, Vol.10 No.3, July 2, 2019

  ABSTRACT: Pseudo-random sequences with long period, low correlation, high linear complexity, and uniform distribution of bit patterns are widely used in the field of information security and cryptography. This paper proposes an approach for generating a pseudo-random multi-value sequence (including a binary sequence) by utilizing a primitive polynomial, trace function, and k-th power residue symbol over the sub extension field. All our previous sequences are defined over the prime field, whereas, proposed sequence in this paper is defined over the sub extension field. Thus, it’s a new and innovative perception to consider the sub extension field during the sequence generation procedure. By considering the sub extension field, two notable outcomes are: proposed sequence holds higher linear complexity and more uniform distribution of bit patterns compared to our previous work which defined over the prime field. Additionally, other important properties of the proposed multi-value sequence such as period, autocorrelation, and cross-correlation are theoretically shown along with some experimental results.