On the Expansion Complexity of Sequences Over Finite Fields
Domingo Gómez‐Pérez, László Mérai, Harald Niederreiter · IEEE Transactions on Information Theory · 2018
In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. In this paper, we slightly modify this notion to obtain the so-called irreducible-expansion complexity which is more suitable for certain applications. We analyze both, the classical and the modified expansion complexity. Moreover, we also study the expansion complexity of the explicit inversive congruential generator.