Abstract
In this paper, we point out a significant difference between the linear complexity and the 2-adic complexity of periodic binary sequences. The concept of the symmetric 2-adic complexity of periodic binary sequences is presented based on this observation. We determine the expected value of the 2-adic complexity and derive a lower bound on the expected value of the symmetric 2-adic complexity of periodic binary sequences. Because the 2-adic complexity of periodic binary sequences is unstable, we present the concepts of the k-error 2-adic complexity and the k-error symmetric 2-adic complexity, and lower bounds on them are also derived.
This work was supported by National Key Foundation Research 973 Project (No. G1999035802), National Nature Science Foundation Project (No. 60273027) and National Distinguished Youth Science Foundation Project (No. 60025205) of China.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ding, C., Xiao, G., Shan, W.: The Stability Theory of Stream Ciphers. LNCS, vol. 561. Springer, Heidelberg (1991)
Goresky, M., Klapper, A.: Feedback registers based on ramified extensions of the 2-adic numbers. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 215–222. Springer, Heidelberg (1995)
Goresky, M., Klapper, A.: Large periods nearly de bruijn FCSR sequences. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 263–273. Springer, Heidelberg (1995)
Goresky, M., Klapper, A.: Cryptanalysis based on 2-adic rational approximation. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 262–273. Springer, Heidelberg (1995)
Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory, in GTM, 2nd edn., vol. 84. Springer, New York (1990)
Jiang, S., Dai, Z., Imamura, K.: Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period. IEEE Trans. Inform. Theory 46, 1174–1177 (2000)
Klapper, A., Goresky, M.: 2-adic shift registers. In: Anderson, R. (ed.) FSE 1993. LNCS, vol. 809, pp. 174–178. Springer, Heidelberg (1994)
Klapper, A., Goresky, M.: Feedback shift registers, 2-adic span, and combiners with memory. J. Cryptology 10, 111–147 (1997)
Koblitz, N.: p-Adic Numbers, p-Adic Analysis, and Zeta Functions, Graduate Texts in Mathematics, vol. 58. Springer, New York (1984)
Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Info. Theory IT-15, 122–127 (1969)
Meidl, W.: Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences 290. Theoretical Computer Science, 2045–2051 (2003)
Meidl, W., Niederreiter, H.: On the expected value of the linear complexity and the k-error linear complexity of periodic sequences. IEEE Trans. Inform. Theory 48, 2817–2825 (2002)
Qi, W., Xu, H.: Partial period distribution of FCSR sequences. IEEE Trans. Inform. Theory 49, 761–765 (2003)
Rueppel, R.A.: Analysis and Design of Stream Cipher. Springer, Berlin (1986)
Seo, C., Lee, S., Sung, Y., Han, K., Kim, S.: A lower bound on the linear span of an FCSR. IEEE Trans. Info. Theory IT-46, 691–693 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, H., Feng, D. (2005). On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences. In: Helleseth, T., Sarwate, D., Song, HY., Yang, K. (eds) Sequences and Their Applications - SETA 2004. SETA 2004. Lecture Notes in Computer Science, vol 3486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11423461_12
Download citation
DOI: https://doi.org/10.1007/11423461_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26084-4
Online ISBN: 978-3-540-32048-7
eBook Packages: Computer ScienceComputer Science (R0)