Chaotic block iterating method for pseudo-random sequence generator

• 出 处: The Journal of China Universities of Posts and Telecommunica
• 发表日期: 2007年01期
• 关键词: generator iteration cryptography performing approximate operations exchanging in

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 example calculations based on the initial value, an approximate pseudo-random sequence was obtained after exchanging bits. 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.