On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values
From MaRDI portal
Publication:2129347
DOI10.2478/UDT-2020-0008zbMATH Open1498.11031arXiv2011.03457OpenAlexW3120380919MaRDI QIDQ2129347FDOQ2129347
Authors: Pierre Popoli 
Publication date: 22 April 2022
Published in: Uniform distribution theory (Search for Journal in Brave)
Abstract: Both the Thue-Morse and Rudin-Shapiro sequences are not suitable sequences for cryptography since their expansion complexity is small and their correlation measure of order 2 is large. These facts imply that these sequences are highly predictable despite the fact that they have a large maximum order complexity. Sun and Winterhof (2019) showed that the Thue-Morse sequence along squares keeps a large maximum order complexity. Since, by Christol's theorem, the expansion complexity of this rarefied sequence is no longer bounded, this provides a potentially better candidate for cryptographic applications. Similar results are known for the Rudin-Shapiro sequence and more general pattern sequences. In this paper we generalize these results to any polynomial subsequence (instead of squares) and thereby answer an open problem of Sun and Winterhof. We conclude this paper by some open problems.
Full work available at URL: https://arxiv.org/abs/2011.03457
Recommendations
- On the maximum order complexity of the Thue-Morse and Rudin-Shapiro sequence
- Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences
- The subword complexity of polynomial subsequences of the Thue-Morse sequence
- On the \(N\)th maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence
- Pseudorandom sequences derived from automatic sequences
Cites Work
- Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Automatic Sequences
- Measures of pseudorandomness for finite sequences: typical values
- The sum-of-digits function of polynomial sequences
- On the subword complexity of Thue-Morse polynomial extractions
- On finite pseudorandom binary sequences. II: The Champernowne, Rudin-Shapiro, and Thue-Morse sequences, a further construction
- On the use of expansion series for stream ciphers
- On the pseudorandomness of automatic sequences
- Normality along squares
- Rudin-Shapiro sequences along squares
- On the maximum order complexity of the Thue-Morse and Rudin-Shapiro sequence
- The Rudin-Shapiro sequence and similar sequences are normal along squares
Cited In (4)
- Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences
- On the \(N\)th maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence
- Pseudorandom sequences derived from automatic sequences
- On the maximum order complexity of the Thue-Morse and Rudin-Shapiro sequence
This page was built for publication: On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129347)
