# On the joint 2-adic complexity of binary multisequences∗

RAIRO - Theoretical Informatics and Applications (2012)

- Volume: 46, Issue: 3, page 401-412
- ISSN: 0988-3754

## Access Full Article

top## Abstract

top## How to cite

topZhao, Lu, and Wen, Qiao-Yan. "On the joint 2-adic complexity of binary multisequences∗." RAIRO - Theoretical Informatics and Applications 46.3 (2012): 401-412. <http://eudml.org/doc/222028>.

@article{Zhao2012,

abstract = {Joint 2-adic complexity is a new important index of the cryptographic security for
multisequences. In this paper, we extend the usual Fourier transform to the case of
multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for
the multisequences with pn-period, we discuss
the relation between sequences and their Fourier coefficients. Based on the relation, we
determine a lower bound for the number of multisequences with given joint 2-adic
complexity.},

author = {Zhao, Lu, Wen, Qiao-Yan},

journal = {RAIRO - Theoretical Informatics and Applications},

keywords = {Cryptography; stream cipher; FCSR; joint 2-adic complexity; usual Fourier transform; cryptography; Fourier transform},

language = {eng},

month = {8},

number = {3},

pages = {401-412},

publisher = {EDP Sciences},

title = {On the joint 2-adic complexity of binary multisequences∗},

url = {http://eudml.org/doc/222028},

volume = {46},

year = {2012},

}

TY - JOUR

AU - Zhao, Lu

AU - Wen, Qiao-Yan

TI - On the joint 2-adic complexity of binary multisequences∗

JO - RAIRO - Theoretical Informatics and Applications

DA - 2012/8//

PB - EDP Sciences

VL - 46

IS - 3

SP - 401

EP - 412

AB - Joint 2-adic complexity is a new important index of the cryptographic security for
multisequences. In this paper, we extend the usual Fourier transform to the case of
multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for
the multisequences with pn-period, we discuss
the relation between sequences and their Fourier coefficients. Based on the relation, we
determine a lower bound for the number of multisequences with given joint 2-adic
complexity.

LA - eng

KW - Cryptography; stream cipher; FCSR; joint 2-adic complexity; usual Fourier transform; cryptography; Fourier transform

UR - http://eudml.org/doc/222028

ER -

## References

top- W. Alun, Appendix A. Circulants (Extract) (2008); available at URIhttp://circulants.org/circ/
- F. Fu, H. Niederreiter and F. Özbudak, Joint linear complexity of multisequences consisting of linear recurring sequences. Cryptogr. Commun.1 (2009) 3–29.
- M. Goresky, A. Klapper and L. Washington, Fourier tansform and the 2-adic span of periodic binary sequences. IEEE Trans. Inf. Theory46 (2000) 687–691.
- H. Gu, L. Hu and D. Feng, On the expected value of the joint 2-adic complexity of periodic binary multisequences, in Proc. of International Conference on Sequences and TheirApplications, edited by G. Gong et al. (2006) 199–208.
- A. Klapper and M. Goresky, Feedback shift registers. 2-adic span, and combiners with memory. J. Cryptol.10 (1997) 111–147.
- W. Meidl and H. Niederreiter, Linear complexity, k-error linear complexity, and the discrete Fourier transform. J. Complexity18 (2002) 87–103.
- W. Meidl and H. Niederreiter, The expected value of the joint linear complexity of periodic multisequences. J. Complexity19 (2003) 1–13.
- W. Meidl, H. Niederreiter and A. Venkateswarlu, Error linear complexity measures for multisequences. J. Complexity23 (2007) 169–192.
- C. Seo, S. Lee, Y. Sung, K. Han and S. Kim, A lower bound on the linear span of an FCSR. IEEE Trans. Inf. Theory46 (2000) 691–693.

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.