Chaotic block iterating method for pseudo-random sequence generator  

作　　者：CHEN Shuai ZHONG Xian-xin 

机构地区：[1]Physics Department, Huainan Normal University, Huainan 232001, China [2]Key Laboratory of Optoelectronic Technology and System of State Ministry ofEducation, Chongqing University, Chongqing 400030, China

出　　处：《The Journal of China Universities of Posts and Telecommunications》2007年第1期45-48,共4页中国邮电高校学报（英文版）

摘　　要：A pseudo-random sequence generator is a basic tool for cryptography. To realize a pseudo-random sequence generator, a new block iterating method using shifter, multiplier, and adder operations has been introduced. By increasing the iteration of the counter and by performing calculations based on the initial value, an approximate pseudo-random sequence was obtained after exchanging bits. The algorithm and the complexity of the generator were introduced. The result obtained from the calculation shows that the self-correlation of the ＂m＂ block sequence is two-valued; the block field value is [0, 2^m - 1 ], and the block period is 2^m＋8 - 1.A pseudo-random sequence generator is a basic tool for cryptography. To realize a pseudo-random sequence generator, a new block iterating method using shifter, multiplier, and adder operations has been introduced. By increasing the iteration of the counter and by performing calculations based on the initial value, an approximate pseudo-random sequence was obtained after exchanging bits. The algorithm and the complexity of the generator were introduced. The result obtained from the calculation shows that the self-correlation of the ＂m＂ block sequence is two-valued; the block field value is [0, 2^m - 1 ], and the block period is 2^m＋8 - 1.

关 键 词：pseudo-random sequence GENERATOR algorithm calculation 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]