2021
DOI: 10.48550/arxiv.2106.09959
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

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

Abstract: Automatic sequences are not suitable sequences for cryptographic applications since both their subword complexity and their expansion complexity are small, and their correlation measure of order 2 is large. These sequences are highly predictable despite having a large maximum order complexity. However, recent results show that polynomial subsequences of automatic sequences, such as the Thue-Morse sequence, are better candidates for pseudorandom sequences. A natural generalization of automatic sequences are mor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 20 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?