Back to Search
Start Over
On the Expansion Complexity of Sequences Over Finite Fields.
- Source :
- IEEE Transactions on Information Theory; Jun2018, Vol. 64 Issue 6, p4228-4232, 5p
- Publication Year :
- 2018
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 64
- Issue :
- 6
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 129840938
- Full Text :
- https://doi.org/10.1109/TIT.2018.2792490