On the maximum order complexity of subsequences of the Thue–Morse and Rudin–Shapiro sequence along squares
Z Sun, A Winterhof - International Journal of Computer Mathematics …, 2019 - Taylor & Francis
Automatic sequences such as the Thue–Morse sequence and the Rudin–Shapiro sequence
are highly predictable and thus not suitable in cryptography. In particular, they have small …
are highly predictable and thus not suitable in cryptography. In particular, they have small …
Pseudorandom sequences derived from automatic sequences
L Mérai, A Winterhof - Cryptography and Communications, 2022 - Springer
Many automatic sequences, such as the Thue-Morse sequence or the Rudin-Shapiro
sequence, have some desirable features of pseudorandomness such as a large linear …
sequence, have some desirable features of pseudorandomness such as a large linear …
Maximum-order Complexity and 2-Adic Complexity
Z Chen, Z Chen, J Obrovsky… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
The 2-adic complexity has been well-analyzed in the periodic case. However, we are not
aware of any theoretical results in the aperiodic case. In particular, the N th 2-adic …
aware of any theoretical results in the aperiodic case. In particular, the N th 2-adic …
The Expansion Complexity of Ultimately Periodic Sequences Over Finite Fields
The expansion complexity is a new figure of merit for cryptographic sequences. In this paper,
we present an explicit formula of the (irreducible) expansion complexity of ultimately periodic …
we present an explicit formula of the (irreducible) expansion complexity of ultimately periodic …
Perfect linear complexity profile and apwenian sequences
JP Allouche, GN Han, H Niederreiter - Finite Fields and Their Applications, 2020 - Elsevier
Sequences with perfect linear complexity profile were defined more than thirty years ago in
the study of measures of randomness for binary sequences. More recently apwenian …
the study of measures of randomness for binary sequences. More recently apwenian …
Algebraic dependence in generating functions and expansion complexity
D Gómez-Pérez, L Mérai - arXiv preprint arXiv:1905.01079, 2019 - arxiv.org
In 2012, Diem introduced a new figure of merit for cryptographic sequences called
expansion complexity. Recently, a series of paper has been published for analysis of …
expansion complexity. Recently, a series of paper has been published for analysis of …
Pseudorandom binary sequences: quality measures and number-theoretic constructions
A Winterhof - IEICE Transactions on Fundamentals of Electronics …, 2023 - search.ieice.org
In this survey we summarize properties of pseudorandomness and non-randomness of
some number-theoretic sequences and present results on their behaviour under the …
some number-theoretic sequences and present results on their behaviour under the …