On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values

DOI10.2478/UDT-2020-0008MaRDI QIDQ2129347zbMATH OpenOpenAlexFDO

Authors Pierre Popoli

Publication date 22 April 2022

Published in Uniform distribution theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/2011.03457

zbMATH Keywords

polynomialspseudorandomnessautomatic sequencesThue-Morse sequenceRudin-Shapiro sequence

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Automata sequences (11B85)

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.

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

• Automatic Sequences
• Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
• Measures of pseudorandomness for finite sequences: typical values
• Normality along squares
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• On finite pseudorandom binary sequences. II: The Champernowne, Rudin-Shapiro, and Thue-Morse sequences, a further construction
• On the maximum order complexity of the Thue-Morse and Rudin-Shapiro sequence
• On the pseudorandomness of automatic sequences
• On the subword complexity of Thue-Morse polynomial extractions
• On the use of expansion series for stream ciphers
• Rudin-Shapiro sequences along squares
• The Rudin-Shapiro sequence and similar sequences are normal along squares
• The sum-of-digits function of polynomial sequences

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)