Title :
On the k-error Linear Complexity of Sequences with Period pn over GF(q)
Author :
Zhou, Jianqin ; Shangguan, Cheng
Abstract :
We investigate the minimum value m(S) of k for which the k-error linear complexity is strictly less than the linear complexity of a given sequence S with period N=pn over GF(q). The upper and lower bounds on m(S) are derived to show the relationship between the linear complexity of a given pn-periodic sequence over GF(q) and the minimum value m(S). Numerical examples are given to verify the results.
Keywords :
computational complexity; k-error linear complexity; pn·-periodic sequence; stream ciphers; Algorithm design and analysis; Binary sequences; Computational intelligence; Computer science; Computer security; Cryptography; Linear feedback shift registers; Stability; periodic sequence; stream ciphers;
Conference_Titel :
Computational Intelligence and Security, 2008. CIS '08. International Conference on
Conference_Location :
Suzhou
Print_ISBN :
978-0-7695-3508-1
DOI :
10.1109/CIS.2008.144
