Abstract
Recently people show some interest in the word-based stream ciphers. The theory of such stream ciphers requires the study of the complexity of multisequences. The 2-adic complexity is the FCSR analog of the linear complexity, and it is very useful in the study of the security of stream ciphers. The improved version of 2-adic complexity—the symmetric 2-adic complexity was presented in 2004 which is a better measure for the cryptographic strength of binary sequences. In this paper, we derive the expected value of the joint 2-adic complexity of periodic binary multisequences. A nontrivial lower bound for the expected value of the joint symmetric 2-adic complexity of periodic binary multisequences is also given.
This work was supported in part by the National Natural Science Foundation of China (No. 90604011 and 90604036) and the National Grand Fundamental Research 973 Program of China (No. 2004CB318004).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Klapper, A., Goresky, M.: 2-adic shift registers. In: Anderson, R. (ed.) FSE 1993. LNCS, vol. 809, pp. 174–178. Springer, Heidelberg (1994)
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)
Klapper, A., Goresky, M.: 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)
Klapper, A., Goresky, M.: Cryptanalysis based on 2-adic rational approximation. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 262–273. Springer, Heidelberg (1995)
Hu, H., Feng, D.: On the 2-adic complexity and the k-error 2-adic complexity of periodic binary sequences. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 185–196. Springer, Heidelberg (2005)
Klapper, A., Goresky, M.: Feedback shift registers, 2-adic span, and combiners with memory. J. Cryptology 10, 111–147 (1997)
Rueppel, R.A.: Analysis and Design of Stream Cipher. Springer, Berlin (1986)
Meidl, W.: Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. Theoretical Computer Science, vol. 290, pp. 2045–2051 (2003)
Koblitz, N.: p-Adic Numbers, p-Adic Analysis, and Zeta Functions. Graduate Texts in Mathematics, vol. 58. Springer, New York (1984)
Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory in GTM, 2nd edn., vol. 84. Springer, New York (1990)
Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Info. Theory IT-15, 122–127 (1969)
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)
Meidl, W., Niederreiter, H.: The expected value of the joint linear complexity of periodic multisequences. Journal of Complexity 19, 61–72 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, H., Hu, L., Feng, D. (2006). On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences. In: Gong, G., Helleseth, T., Song, HY., Yang, K. (eds) Sequences and Their Applications – SETA 2006. SETA 2006. Lecture Notes in Computer Science, vol 4086. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11863854_17
Download citation
DOI: https://doi.org/10.1007/11863854_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44523-4
Online ISBN: 978-3-540-44524-1
eBook Packages: Computer ScienceComputer Science (R0)