Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The k-error linear complexity is an important cryptographic measure of pseudorandom sequences in stream ciphers. ,  investigate the k-error linear complexity of p2-periodic binary sequences defined from the polynomial quotients modulo p, which are the generalizations of the ll-studied Fermat quotients. Indeed, first  determine exact values of the k-error linear complexity over the finite field \(\mathbb{F}_2\) for these binary sequences under the assumption of 2 being a primitive root modulo p2, and then  determine their k-error linear complexity over the finite field \(\mathbb{F}_p\). Theoretical results obtained indicate that such sequences possess ‘good’ error linear complexity.
['Zhixiong Chen', 'Zhihua Niu', 'Chenhuang Wu']
I am writing a research paper on a idea On the k -error linear complexity of binary sequences derived from polynomial quotients
[{"from": "human", "value": "I am writing a research paper on a idea On the k -error linear complexity of binary sequences derived from polynomial quotients"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The k-error linear complexity is an important cryptographic measure of pseudorandom sequences in stream ciphers. ,  investigate the k-error linear complexity of p2-periodic binary sequences defined from the polynomial quotients modulo p, which are the generalizations of the ll-studied Fermat quotients. Indeed, first  determine exact values of the k-error linear complexity over the finite field \\(\\mathbb{F}_2\\) for these binary sequences under the assumption of 2 being a primitive root modulo p2, and then  determine their k-error linear complexity over the finite field \\(\\mathbb{F}_p\\). Theoretical results obtained indicate that such sequences possess \u2018good\u2019 error linear complexity."}]