Skip to main content

The Asymptotic Behavior of π-Adic Complexity with π2 = − 2

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 4893))

Abstract

We study the asymptotic behavior of stream cipher security measures associated with algebraic feedback shift registers and feedback based on the ring \(\mathbb Z [\sqrt{-2}]\). For non-periodic sequences we consider normalized \(\sqrt{2}\)-adic complexity and study the set of accumulation points for a fixed sequence. The the set of accumulation points is a closed subinterval of the real closed interval [0,1]. We see that this interval is of the form [B,1 − B] “most” of the time, and that all such intervals occur for some sequence.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Borevich, Z.I., Shefarevich, I.R.: Number Theory. Academic Press, New York (1966)

    MATH  Google Scholar 

  2. Dai, Z., Imamura, K., Yang, J.: Asymptotic behavior of normalized linear complexity of multi-sequences. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 126–142. Springer, Heidelberg (2005)

    Google Scholar 

  3. Dai, Z., Jiang, S., Imamura, K., Gong, G.: Asymptotic behavior of normalized linear complexity of ultimately non-periodic sequences. In: IEEE Trans. Info. Theory, vol. 50, pp. 2911–2915. IEEE Computer Society Press, Los Alamitos

    Google Scholar 

  4. Feng, X., Dai, X.: The expected value of the normalized linear complexity of 2-dimensional binary sequences. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 113–128. Springer, Heidelberg (2005)

    Google Scholar 

  5. Klapper, A.: The Asymptotic Behavior of 2-Adic Complexity, under review

    Google Scholar 

  6. Klapper, A.: Distribution properties of d-FCSR sequences. Journal of Complexity 20, 305–317 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Klapper, A., Goresky, M.: Feedback Shift Registers, 2-Adic Span, and Combiners with Memory. J. Cryptology 10, 111–147 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. Klapper, A., Xu, J.: Algebraic feedback shift registers. Theoretical Comp. Sci. 226, 61–93 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Klapper, A., Xu, J.: Register synthesis for algebraic feedback shift registers based on non-primes. Designs, Codes, and Cryptography 31, 225–227 (2004)

    Article  MathSciNet  Google Scholar 

  10. Massey, J.: Shift-register synthesis and BCH decoding. IEEE Trans. Infor. Theory IT-15, 122–127 (1969)

    Article  MathSciNet  Google Scholar 

  11. Niederreiter, H.: The probabilistic theory of linear complexity. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 191–209. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Solomon W. Golomb Guang Gong Tor Helleseth Hong-Yeop Song

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klapper, A. (2007). The Asymptotic Behavior of π-Adic Complexity with π2 = − 2. In: Golomb, S.W., Gong, G., Helleseth, T., Song, HY. (eds) Sequences, Subsequences, and Consequences. Lecture Notes in Computer Science, vol 4893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77404-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77404-4_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77403-7

  • Online ISBN: 978-3-540-77404-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics