Skip to main content
SpringerLink
Log in

On the k-error Joint Linear Complexity and Error Multisequence over F q (char F q  = p, prime)

  • Conference paper
Recent Trends in Computer Networks and Distributed Systems Security (SNDS 2014)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 420))

  • 2466 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ding, C., Xiao, G., Shan, W. (eds.): The Stability Theory of Stream Ciphers. LNCS, vol. 561. Springer, Heidelberg (1991)

    MATH  Google Scholar 

  2. 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)

    Google Scholar 

  3. 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)

    Article  Google Scholar 

  4. 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)

    Chapter  Google Scholar 

  5. 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)

    Article  MATH  MathSciNet  Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. Meidl, W., Niederreiter, H., Venkateswarlu, A.: Error linear complexity Measures for Multisequences. Journal of Complexity 23(2), 169–192 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  8. Meidl, W., Niederreiter, H.: The expected value of the joint linear complexity of periodic multisequences. Journal of Complexity 19(1), 61–72 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. 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)

    Chapter  Google Scholar 

  10. 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)

    Article  MATH  MathSciNet  Google Scholar 

  11. 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)

    Article  MATH  MathSciNet  Google Scholar 

  12. Sindhu, M., Sethumadhavan, M.: Linear Complexity Measures of Binary Multisequences. International Journal of Computer Applications 16, 6–10 (2013)

    Google Scholar 

  13. 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)

    Article  MATH  MathSciNet  Google Scholar 

  14. Venkateswarlu, Studies on error linear complexity measures for multisequences, PhD thesis (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. TIFAC CORE in Cyber Security, Amrita Vishwa Vidyapeetham, Coimbatore, India

    M. Sindhu & M. Sethumadhavan

Authors
  1. M. Sindhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Sethumadhavan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Facultad de Informatica, Campus de Espinardo, s/n, 30., 100, Murcia, Spain

    Gregorio Martínez Pérez

  2. Indian Institute of Information Technology and Management, Technopark Campus, 695581, Trivandrum, Kerala, India

    Sabu M. Thampi

  3. Faculty of Computing and Mathematical Sciences, The University of Waikato, Waikato Mail Centre, Private Bag 3105, Hamilton, New Zealand

    Ryan Ko

  4. Guangdong University of Petrochemical Technology, P.R. China

    Lei Shu

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation