一种生成给定二进制序列的非线性更新最小寄存器的构造算法
An Algorithm for Constructing a Smallest Register with Non-Linear Update Generating a Given Binary Sequence
摘要:
具有非线性更新的寄存器(RNLU)是非线性反馈移位寄存器(NLFSR)的推广,其中允许反馈和前馈连接,并且不需要级之间的链式连接。本文提出了一种新的生成给定二进制序列的RNLU的构造算法。证明了该算法所构造的RNLU的期望长度为O(n/log(n/p)),其中n为序列长度,p为并行度。这渐近地小于由先前算法构造的RNLU的预期大小以及生成相同序列的LFSR和NLFSR的预期大小。所提出的算法可以潜在地用于许多应用,包括测试、无线通信和密码学。
英文摘要:
Registers with Non-Linear Update (RNLUs) are a generalization of Non-Linear Feedback Shift Registers (NLFSRs) in which both, feedback and feedforward, connections are allowed and no chain connection between the stages is required. In this paper, a new algorithm for constructing RNLUs generating a given binary sequence is presented. Expected size of RNLUs constructed by the presented algorithm is proved to be O(n/log(n/p)), where n is the sequence length and p is the degree of parallelization. This is asymptotically smaller than the expected size of RNLUs constructed by previous algorithms and the expected size of LFSRs and NLFSRs generating the same sequence. The presented algorithm can potentially be useful for many applications, including testing, wireless communications, and cryptography.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。