arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1702.05329math.NT
收藏

关于序列在有限域上的扩展复杂度

On the expansion complexity of sequences over finite fields

Gómez-Pérez, László Mérai, Harald Niederreiter

摘要:

2012年,Diem为加密序列引入了一个新的品质因数,称为扩展复杂度。在本文中,我们稍微修改这个概念,以获得所谓的不可约扩展复杂性,这是更适合于某些应用。我们分析这两个,经典的和修改后的扩展复杂性。此外,我们还研究了显式逆同余生成元的展开复杂性。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑