Skip to main content
Log in

On the pseudorandomness of automatic sequences

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

Abstract

We study the pseudorandomness of automatic sequences in terms of well-distribution and correlation measure of order 2. We detect non-random behavior which can be derived either from the functional equations satisfied by their generating functions or from their generating finite automatons, respectively.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Allouche, J.-P.: Finite automata and arithmetic. Séminaire Lotharingien de Combinatoire (Gerolfingen, 1993), 1–18, Prépubl. Inst. Rech. Math. Av., 1993/34, Univ. Louis Pasteur, Strasbourg (1993)

  2. Allouche, J.P., Shallit, J.: Automatic sequences. Theory, applications, generalizations. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  3. Alon, N., Kohayakawa, Y., Mauduit, C., Moreira, C.G., Rödl, V.: Measures of pseudorandomness for finite sequences: typical values. Proc. Lond. Math. Soc. 95(3), 778–812 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Christol, G.: Ensembles presque periodiques k-reconnaissables. Theoret. Comput. Sci. 9, 141–145 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  5. Christol, G., Kamae, T., Mendés France, M., Rauzy, G.: Suites algébriques, automates et substitutions. Bull. Soc. Math. France 108(4), 401–419 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dorfer, G., Meidl, W., Winterhof, A.: Counting functions and expected values for the lattice profile at n. Finite Fields Appl. 10(4), 636–652 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Drmota, M.: Subsequences of automatic sequences and uniform distribution. In: Kritzer, P. (ed.) Uniform distribution and quasi-Monte Carlo methods, 87–104, Radon Ser. Comput. Appl Math., vol. 15. De Gruyter, Berlin (2014)

  8. Everest, G., van der Poorten, A., Shparlinski, I., Ward, T.: Recurrence Sequences Mathematical Surveys and Monographs, vol. 104. American Mathematical Society, Providence (2003)

    Google Scholar 

  9. Gyarmati, K.: Measures of pseudorandomness. In: Charpin, P., Pott, A., Winterhof, A. (eds.) Finite fields and their applications Radon Series in Computational and Applied Mathematics, de Gruyter, pp 43–64 (2013)

  10. Hofer, R., Winterhof, A.: Linear complexity and expansion complexity of some number theoretic sequences. In: Arithmetics in Finite Fields (WAIFI 2016). Lecture Notes in Computer Science, vol. 10064, pp 67–74. Springer, Cham (2017)

  11. Mauduit, C., Sárközy, A.: On finite pseudorandom binary sequences. I. Measure of pseudorandomness, the Legendre symbol. Acta Arith. 82(4), 365–377 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  12. Mauduit, C., Sárközy, A.: On finite pseudorandom binary sequences. II. The Champernowne, Rudin-Shapiro, and Thue-Morse sequences, a further construction. J. Number Theory 73(2), 256–276 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  13. Mérai, L., Winterhof, A.: On the N th linear complexity of p-automatic sequences over 𝔽 p . Preprint (2016)

  14. Niederreiter, H.: The Probabilistic Theory of Linear Complexity. Advances in Cryptology-EUROCRYPT ’88 (Davos, 1988), 191–209, Lecture Notes in Comput. Sci, vol. 330. Springer, Berlin (1988)

    Google Scholar 

  15. Niederreiter, H.: Sequences with almost perfect linear complexity profile. Advances in cryptology-EUROCRYPT ’87. In: Chaum, D., Price, W.L. (eds.) Lecture Notes in Computer Science, vol. 304, pp 37–51. Springer, Berlin (1988)

  16. Sárközy, A.: On finite pseudorandom binary sequences and their applications in cryptography. Tatra. Mt. Math. Publ. 37, 123–136 (2007)

    MathSciNet  MATH  Google Scholar 

  17. Topuzoglu, A., Winterhof, A.: Pseudorandom Sequences. Topics in Geometry, Coding Theory and Cryptography, 135–166, Algebr Appl, vol. 6. Springer, Dordrecht (2007)

    Google Scholar 

Download references

Acknowledgment

The authors would like to thank Christian Mauduit for helpful discussions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to László Mérai.

Additional information

This article is part of the Topical Collection on Special Issue on Sequences and Their Applications

The authors are partially supported by the Austrian Science Fund FWF Project 5511-N26 which is part of the Special Research Program “Quasi-Monte Carlo Methods: Theory and Applications”.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mérai, L., Winterhof, A. On the pseudorandomness of automatic sequences. Cryptogr. Commun. 10, 1013–1022 (2018). https://doi.org/10.1007/s12095-017-0260-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-017-0260-7

Keywords

Mathematics Subject Classification (2010)

Navigation