arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1905.01079math.NT
收藏

generating functions中的代数依赖性和扩展复杂性

Algebraic dependence in generating functions and expansion complexity

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

摘要:

2012年,Diem为加密序列引入了一个新的品质因数,称为扩展复杂度。最近,一系列的论文已经发表了分析的扩展复杂性和测试序列在这个新的措施的随机性。在本文中,我们继续这一分析。首先,我们研究的基础多项式理想的Gröbner基础方面的扩展复杂性。其次,我们证明了随机序列的扩展复杂度的界。最后,我们研究了由微分方程定义的序列的扩展复杂度,包括逆生成元。

英文摘要:

In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. Recently, a series of paper has been published for analysis of expansion complexity and for testing sequences in terms of this new measure of randomness. In this paper, we continue this analysis. First we study the expansion complexity in terms of the Gröbner basis of the underlying polynomial ideal. Next, we prove bounds on the expansion complexity for random sequences. Finally, we study the expansion complexity of sequences defined by differential equations, including the inversive generator.

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

↑