On the maximum order complexity of subsequences of the Thue-Morse and Rudin-Shapiro sequence along squares

TL;DR

This paper investigates the maximum order complexity of subsequences of the Thue-Morse and Rudin-Shapiro sequences along squares, revealing they maintain high complexity without low expansion complexity, making them potential cryptographic candidates.

Contribution

It demonstrates that subsequences along squares of these sequences have large maximum order complexity and improved cryptographic suitability compared to the original sequences.

Findings

Subsequences along squares retain high maximum order complexity.

These subsequences do not have small expansion complexity.

Potential cryptographic applications due to increased complexity.

Abstract

Automatic sequences such as the Thue-Morse sequence and the Rudin-Shapiro sequence are highly predictable and thus not suitable in cryptography. In particular, they have small expansion complexity. However, they still have a large maximum order complexity. Certain subsequences of automatic sequences are not automatic anymore and may be attractive candidates for applications in cryptography. In this paper we show that subsequences along the squares of certain pattern sequences including the Thue-Morse sequence and the Rudin-Shapiro sequence have also large maximum order complexity but do not suffer a small expansion complexity anymore.