On the Expansion Complexity of Sequences Over Finite Fields

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 modif...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2018-06, Vol.64 (6), p.4228-4232
Main Authors: Gomez-Perez, Domingo, Merai, Laszlo, Niederreiter, Harald
Format: Article
Language:English
Subjects:
Complexity
Complexity theory
Cryptography
expansion complexity
Fields (mathematics)
Figure of merit
Galois fields
Generators
Indexes
inversive generator
Pseudorandom sequence
Q measurement
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2018.2792490