ProgramsView all programs
From the news
- Chancellor Amma Addresses the Parliament of World’s Religions
- Amrita Students Qualify for the European Mars Rover Challenge
Publication Type : Journal Article
Publisher : Communications in Computer and Information Science
Source : Communications in Computer and Information Science, Springer Verlag, Volume 420 CCIS, Trivandrum, p.512-519 (2014)
ISBN : 9783642545245
Keywords : Algorithms, Fast and efficient algorithms, Joint linear complexity, Multi-sequences, Network security, Security analysis, Stamp-Martin algorithm, Word based stream cipher
Campus : Coimbatore
School : School of Engineering
Center : TIFAC CORE in Cyber Security
Department : Computer Science, Mathematics, cyber Security
Year : 2014
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.
Cite this Research Publication : 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.