On the Expansion Complexity of Sequences over Finite Fields

Ver/Abrir
Identificadores
URI: http://hdl.handle.net/10902/15501
ISSN: 0018-9448
ISSN: 1557-9654
Compartir
Estadísticas
Ver Estadísticas
Google Scholar
Registro completo
Mostrar el registro completo DC
Autoría
Gómez Pérez, DomingoAutoridad Unican; Mérai, László; Niederreiter, Harald
Fecha
2018-06
Derechos
© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Publicado en
IEEE Transactions on Information Theory, Volume: 64, Issue: 6, June 2018, Page(s): 4228 - 4232
Editorial
Institute of Electrical and Electronics Engineers Inc.
Enlace a la publicación
Resumen/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.
Colecciones a las que pertenece