摘要
文中提出用计算机搜索算法,利用真值表后继状态的互补对称性,快速生成任意级数的全部de Bruijn序列的通用方法,并对算法进行改进,以加快de Bruijn序列的生成时间。文中详细说明了对应的计算机程序设计方法,最后给出实验数据,验证算法的可行性与快速性。此算法方案可以作为设计序列密码的密钥发生器,亦可以用于通信领域,具有一定的实用性。
This paper presents a method of computer searching algorithm which, using complementation and symmetry of state-value table, generates arbitrary orders of all de Bruijn sequences rapidly, and improves the algorithm to break through the time limitation in the process of de Bruijn sequences generation, At the same time, the programming method is illuminated in detail. Finally the experimental data is given to prove the feasibility of the algorithm. This scheme is practical and can be as a reference for designing the key generator of stream cipher, and used in communication and code as well.
出处
《通信技术》
2007年第11期302-303,402,共3页
Communications Technology
基金
浙江省自然科学基金资助项目(20050495)
