On the k-error Joint Linear Complexity and Error Multisequence over F

Abstract

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.