On the Maximum Order Complexity of Thue–Morse and Rudin–Shapiro Sequences along Polynomial Values
Work
Year: 2020
Type: article
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 im... more
Source: Uniform distribution theory
Author Pierre Popoli
Institutions Université de Lorraine, Institut Élie Cartan de Lorraine
Cites: 15
Cited by: 6
Related to: 10
FWCI: 0.59
Citation percentile (by year/subfield): 78.22
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid