Algebraic dependence in generating functions and expansion complexity (Q2176295): Difference between revisions

\textit{C. Diem} [Algebra Number Theory 7, No. 6, 1281--1323 (2013; Zbl 1300.11132)] introduced a measure of pseudorandomness for cryptographic sequences called expansion complexity which was further analyzed by the second author et al. [Cryptogr. Commun. 9, No. 4, 501--509 (2017; Zbl 1409.94855)] and the authors et al. [IEEE Trans. Inf. Theory 64, No. 6, 4228--4232 (2018; Zbl 1395.94262)]. First the authors express the expansion complexity in terms of the Gröbner basis of its defining ideal. Then they present a corrected form of [the second author et al., loc. cit., Theorem 4] on the typical value of the expansion complexity. Finally, they study the expansion complexity of sequences defined by differential equations including the explicit inversive generator.