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

有限域上序列的扩展复杂度和线性复杂度

Expansion complexity and linear complexity of sequences over finite fields

László Mérai, Harald Niederreiter, Arne Winterhof

摘要:

线性复杂度是对有限域上序列的不可预测性的度量,因此也是对它在密码学中的适用性的度量。2012年,Diem为加密序列引入了一个新的品质因数,称为扩展复杂度。研究了线性复杂度与扩展复杂度之间的关系。特别是,我们表明,对于纯周期序列的品质因数提供基本上相同的质量测试的序列的一个足够长的一部分。然而,如果我们研究周期或非周期序列的较短部分,那么我们可以粗略地表明,扩展复杂性提供了更强的测试。我们证明了这一点,通过分析一系列的二项式系数模$p$。最后,我们建立了随机序列在有限域上的扩展复杂性的概率结果。

英文摘要:

The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. We study the relationship between linear complexity and expansion complexity. In particular, we show that for purely periodic sequences both figures of merit provide essentially the same quality test for a sufficiently long part of the sequence. However, if we study shorter parts of the period or nonperiodic sequences, then we can show, roughly speaking, that the expansion complexity provides a stronger test. We demonstrate this by analyzing a sequence of binomial coefficients modulo $p$. Finally, we establish a probabilistic result on the behavior of the expansion complexity of random sequences over a finite field.

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

↑