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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Ding, C., Xiao, G., Shan, W. (eds.): The Stability Theory of Stream Ciphers. LNCS, vol. 561. Springer, Heidelberg (1991)
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)
Kaida, T., Uehara, S., Imamaura, K.: An Algorithm for the k-Error Linear Complexity of Sequences over GF(pm) with period pn, p a prime. Information and Computation 151(1-2), 137–147 (1999)
Kaida, T.: On the generalized Lauder Paterson algorithm and profiles of the k-error linear complexity for exponent periodic sequences. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 166–178. Springer, Heidelberg (2005)
Lauder, A.G.B., Paterson, K.G.: Computing the Error Linear Complexity Spectrum of a Binary Sequence of Period 2n. IEEE Transactions on Information Theory 49(1), 273–281 (2003)
Meidl, W.: Discrete Fourier Transform, Joint Linear Complexity and Generalised Joint Linear Complexity of Multisequences. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 101–112. Springer, Heidelberg (2005)
Meidl, W., Niederreiter, H., Venkateswarlu, A.: Error linear complexity Measures for Multisequences. Journal of Complexity 23(2), 169–192 (2007)
Meidl, W., Niederreiter, H.: The expected value of the joint linear complexity of periodic multisequences. Journal of Complexity 19(1), 61–72 (2003)
Niederreiter, H.: Linear Complexity and Related Complexity Measures for Sequences. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 1–17. Springer, Heidelberg (2003)
Sethumadhavan, M., Sindhu, M., Srinivasan, C., Kavitha, C.: An algorithm for k-error joint linear complexity of binary multisequences. Journal of Discrete Mathematical Sciences & Cryptography 11(3), 297–304 (2008)
Sethumadhavan, M., Yogha Laxmie, C., Vijaya Govindan, C.: A construction of p-ary balanced sequence with large k-error linear complexity. Journal of Discrete Mathematical Sciences and Cryptography 9(2), 253–261 (2006)
Sindhu, M., Sethumadhavan, M.: Linear Complexity Measures of Binary Multisequences. International Journal of Computer Applications 16, 6–10 (2013)
Stamp, M., Martin, C.F.: An Algorithm for the k-Error Linear Complexity of Binary Sequences with Period 2n. IEEE Trans. Inf. Theory 39, 1398–1407 (1993)
Venkateswarlu, Studies on error linear complexity measures for multisequences, PhD thesis (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sindhu, M., Sethumadhavan, M. (2014). On the k-error Joint Linear Complexity and Error Multisequence over F q (char F q = p, prime). In: Martínez Pérez, G., Thampi, S.M., Ko, R., Shu, L. (eds) Recent Trends in Computer Networks and Distributed Systems Security. SNDS 2014. Communications in Computer and Information Science, vol 420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54525-2_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-54525-2_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54524-5
Online ISBN: 978-3-642-54525-2
eBook Packages: Computer ScienceComputer Science (R0)