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. © Springer-Verlag Berlin Heidelberg 2014.
cited By (since 1996)0; Conference of org.apache.xalan.xsltc.dom.DOMAdapter@33658791 ; Conference Date: org.apache.xalan.xsltc.dom.DOMAdapter@4ea75af3 Through org.apache.xalan.xsltc.dom.DOMAdapter@4d442fdc; Conference Code:106563
M. Sindhu and Dr. M. Sethumadhavan, “On the k-error Joint Linear Complexity and Error Multisequence over F”, Communications in Computer and Information Science, vol. 420 CCIS, pp. 512-519, 2014.