Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences
Work
Year: 2021
Type: article
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... more
Source: Cryptography and Communications
Authors Damien Jamet, Pierre Popoli, Thomas Stoll
Cites: 26
Cited by: 3
Related to: 10
FWCI: 0.333
Citation percentile (by year/subfield): 57.43
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,834