5 citations · 5 across the 2 of their papers we have counts for
Showing math.NTShow all
3 papers · 1 filter
math.NT2023
Correlation of the Rudin-Shapiro sequence along prime numbers
Pierre Popoli
The correlation measure of order is a measure of pseudorandomness that quantifies the similarity between a sequence and its shifts. It is known that the correlation of order 4…
math.NT2021★ 5 cited
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…
math.NT2020
On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values
Pierre Popoli
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 la…