On the expansion complexity of sequences over finite fields
Number Theory
2017-02-20 v1
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 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.
Cite
@article{arxiv.1702.05329,
title = {On the expansion complexity of sequences over finite fields},
author = {Gómez-Pérez and László Mérai and Harald Niederreiter},
journal= {arXiv preprint arXiv:1702.05329},
year = {2017}
}