arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.10770cs.CRcs.ITmath.IT
收藏

前馈钟控序列的线性复杂度

On the linear complexity of feedforward clock-controlled sequence

Yangpan Zhang, Maozhi Xu

摘要:

作为流密码的一个研究领域,追求安全性和实用性的平衡是重点。安全性的条件通常必须至少满足高周期和高线性复杂度。由于前馈钟控结构具有较高的周期性和实用性,许多序列密码都是基于这种结构构造的。然而,以往的线性复杂度的研究只适用于受控序列是m序列的情况。本文利用环上矩阵和分块矩阵的理论,构造了一种更有用的方法。它可以估计前馈钟控序列线性复杂度的下界。即使是受控序列也具有很大的线性复杂度。

英文摘要:

As a research field of stream ciphers, the pursuit of a balance of security and practicality is the focus. The conditions for security usually have to satisfy at least high period and high linear complexity. Because the feedforward clock-controlled structure can provide quite a high period and utility, many sequence ciphers are constructed based on this structure. However, the past study of its linear complexity only works when the controlled sequence is an m-sequence. Using the theory of matrix over the ring and block matrix in this paper, we construct a more helpful method. It can estimate the lower bound of the linear complexity of the feedforward clock-controlled sequence. Even the controlled sequence has great linear complexity.

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

↑