@article{10902/15501,
year = {2018},
month = {6},
url = {http://hdl.handle.net/10902/15501},
abstract = {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 socalled 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.},
organization = {The research of the first author was supported by the Ministerio de Economia y Competitividad research project MTM2014-55421-P. The second was partially supported by the Austrian Science Fund FWF Project F5511-N26 which is part of the Special Research Program ”Quasi-Monte Carlo Methods: Theory and Applications},
publisher = {Institute of Electrical and Electronics Engineers Inc.},
publisher = {IEEE Transactions on Information Theory, Volume: 64, Issue: 6, June 2018, Page(s): 4228 - 4232},
title = {On the Expansion Complexity of Sequences over Finite Fields},
author = {Gómez Pérez, Domingo and Mérai, László and Niederreiter, Harald},
}