Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences

Damien Jamet, Pierre Popoli, Thomas Stoll

Automatic sequences are not suitable sequences for cryptographic applications since both their subword complexity and their expansion complexity are small, and their correlation me…