Publication Type:

Journal Article

Source:

Communications in Computer and Information Science, Springer Verlag, Volume 420 CCIS, Trivandrum, p.512-519 (2014)

ISBN:

9783642545245

URL:

http://www.scopus.com/inward/record.url?eid=2-s2.0-84904765892&partnerID=40&md5=3b045310b899a0ca0ad4266dc43c2cc1

Keywords:

Algorithms, Fast and efficient algorithms, Joint linear complexity, Multi-sequences, Network security, Security analysis, Stamp-Martin algorithm, Word based stream cipher

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.

Notes:

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

Cite this Research Publication

M. Sindhu and 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.