2017/02/17 by Gómez-Pérez, László Mérai, Mérai, László +2
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Cryptographic Implementations and Security #FOS: Mathematics #Number Theory (math.NT) #graph theory and CDMA systems #math.NT
paper · pdf · doi:10.48550/arxiv.1702.05329
arxiv created 2017/02/17 · openalex publication_date 2017/02/17 · arxiv updated 2017/02/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.