On the k-error Joint Linear Complexity and Error Multisequence over Fq(charFq = p, prime)
Finding fast and efficient algorithms for computing the k-error joint linear complexity and error multisequence of multisequences is of great importance in cryptography, mainly for the security analysis of word based stream ciphers. There is no efficient algorithm for finding the error multisequence of a prime power periodic multisequence. In this paper we propose an efficient algorithm for finding the k-error joint linear complexity together with an error multisequence of m fold prime power periodic multisequences over F q ,where char F q = p, a prime.
KeywordsWord based stream ciphers Multisequences Error Joint Linear Complexity Error multisequence Generalized Stamp-Martin Algorithm
Unable to display preview. Download preview PDF.
- 2.Kaida, T.: On Algorithms for the k-Error Linear Complexity of Sequences over GF(p m ) with Period p n, Ph. D. Thesis, Kyusu Institute of Tech. (1999) Google Scholar
- 12.Sindhu, M., Sethumadhavan, M.: Linear Complexity Measures of Binary Multisequences. International Journal of Computer Applications 16, 6–10 (2013)Google Scholar
- 14.Venkateswarlu, Studies on error linear complexity measures for multisequences, PhD thesis (2007)Google Scholar