CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Linear Complexity Measures of Binary Multisequences

by Sindhu. M, M. Sethumadhavan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 62 - Number 16
Year of Publication: 2013
Authors: Sindhu. M, M. Sethumadhavan
10.5120/10162-4892

Sindhu. M, M. Sethumadhavan . Linear Complexity Measures of Binary Multisequences. International Journal of Computer Applications. 62, 16 ( January 2013), 6-10. DOI=10.5120/10162-4892

@article{ 10.5120/10162-4892,
author = { Sindhu. M, M. Sethumadhavan },
title = { Linear Complexity Measures of Binary Multisequences },
journal = { International Journal of Computer Applications },
issue_date = { January 2013 },
volume = { 62 },
number = { 16 },
month = { January },
year = { 2013 },
issn = { 0975-8887 },
pages = { 6-10 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume62/number16/10162-4892/ },
doi = { 10.5120/10162-4892 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:11:57.213808+05:30
%A Sindhu. M
%A M. Sethumadhavan
%T Linear Complexity Measures of Binary Multisequences
%J International Journal of Computer Applications
%@ 0975-8887
%V 62
%N 16
%P 6-10
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The joint linear complexity and k - error joint linear complexity of an m fold 2n periodic multisequence can be efficiently computed using Modified Games Chan algorithm and Extended Stamp Martin Algorithm respectively. In this paper we derived an algorithm for finding the joint linear complexity of periodic binary multisequence with the help of Modified Games Chan algorithm. Here we derived the minimum value of k for which k-error joint linear complexity is strictly less than the joint linear complexity of binary m fold multisequences of period 2n and an algorithm which, given a constant c and an m fold 2n periodic binary multisequence S, computes the minimum number k of errors and the associated error multisequence needed over a period of S for bringing the joint linear complexity of S below c .

References
  1. Ana Salagean, " On the computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two" , IEEE Trans on Inform. Theory, 51:1145-1150.
  2. Ding, Xiao and Shan, "Stability Theory of Stream Ciphers", LNCS, Vol. 561, Springer Verlag, 1991
  3. R. A. Games and A. H. Chan, "A fast algorithm for determining the linear complexity of a pseudorandom sequence with period 2n", IEEE Trans. Inf. Theory IT-29. pp 144-146 , Jan 1983.
  4. T. Kaida, "On Algorithms for the k-Error Linear Complexity of Sequences over GF(pm) with Period pn", Ph. D. Thesis, Kyusu Institute of Tech. Mar'99.
  5. T. Kaida, S. Uehara and K. Imamaura, "An Algorithm for the k-Error Linear Complexity of Sequences over GF(pm) with period pn, p a prime", Information and Computation 151, 147,1999.
  6. T. Kaida, "On the generalized Lauder Paterson algorithm and profiles of the k-error linear complexity for exponent periodic sequences", in SETA 2004, LNCS,Vol 3486, pp 166-178, 2005.
  7. Kurosawa. K, Sato. F, Sakata. T, Kishimoto. W, "A relationship between linear complexity and k-error linear complexity ", Information Theory, IEEE Transactions on, Vol 46, issue 2, pp 694- 698, 2000.
  8. A. Lauder, K. Paterson, "Computing the Error Linear Complexity Spectrum of a Binary Sequence of Period 2n", IEEE Trans Inf. Theory, Vol. 49, pp. 273-281, Jan 2003.
  9. W. Meidl, "Discrete Fourier Transform, Joint Linear Complexity and Generalised Joint Linear Complexity of Multisequences", SETA 2004, LNCS, Vol. 3486, pp. 101 – 112, Springer, Berlin, 2005.
  10. W. Meidl and Ayineedi Venkateswarlu, "Remarks on the k-error linear complexity of pn - periodic sequences" , Des Codes Crypt (2007) 42:181–193, 14 Nov 2006.
  11. W. Meidl, H. Niederreiter and Ayineedi Venkateswarlu, "Error linear complexity Measures for Multisequences" Journal of Complexity, Volume 23, Issue 2, Pages: 169-192, April 2007.
  12. W. Meidl, "Reducing the calculation of the linear complexity of - periodic binary sequences to Games Chan algorithm", Des. Codes Cryptography,46:57-65,2008.
  13. H. Niederreiter, "Linear Complexity and Related measures for Sequences", LNCS, Vol. 2094, pp. 1-7, Springer 2003.
  14. H. Niederreiter, "The probabilistic theory of the joint linear complexity of multisequences", in: G. Gong, T. Helleseth, H. -Y. Song, K. Yang (Eds. ), SETA 2006, Lecture Notes in Computer Science, vol. 4086, Springer, Berlin, pp. 5–16, 2006.
  15. M. Sethumadhavan, Sindhu. M, Chungath Srinivasan, Kavitha. C, "An algorithm for k-error joint linear complexity of binary multisequences" , Journal of Discrete Mathematical Sciences & Cryptography, volume 11, No 3, June 2008
  16. M. Sethumadhavan, C. Yogha Laxmie and C. Vijaya Govindan, "A construction of p- ary balanced sequence with large k-error linear complexity", Journal of Discrete Mathematical Sciences and Cryptography, Vol. 9, No. 2, pp. 253-261, 2006.
  17. Sindhu. M, Sajan Kumar. S, M. Sethumadhavan, "Error Linear Complexity Measures of Binary Multisequences", Cyber Security, Cyber Crime and Cyber Forensics: Applications and Perspectives, pp 240- 249, 2011.
  18. M. Stamp and C. F. Martin, "An Algorithm for the k-Error Linear Complexity of Binary Sequences with Period 2n", IEEE Trans. Inf. Theory 39, 1398-1407, 1993.
  19. A. Venkateswarlu, "Studies on error linear complexity measures for multisequences", PhD thesis, 2007.
Index Terms

Computer Science
Information Sciences

Keywords

Word based stream ciphers multisequences error multisequence joint linear complexity k-error joint linear complexity kmin

Powered by PhDFocusTM