期刊文献+

细胞自动机组合伪随机序列发生器 被引量:1

Combined Pseudorandom Sequence Generator Based on Cellular Automata
下载PDF
导出
摘要 结合细胞自动机所特有的单元结构的简单性、单元之间作用的局部性和信息处理的高度并行性等特点,利用细胞自动机产生高速序列;分析了比特与、或、异或运算周期特性,其周期等于各自周期的最小公倍数;证明了比特异或运算的频率特性优于原有的频率特性。研究了比特组合运算的线性复杂独特性,比特与、或运算的线性复杂度等于各自线性复杂度的乘积,异或运算的线性复杂度等于各自线性复杂度之和。利用伪随机特性检测方法和线性复杂度的测试方法的计算机模拟表明细胞自动机组合伪随机序列发生器实现简单、速度高、能有效增加序列周期长,改善序列伪随机统计特性,并能有效增加伪随机序列的线性复杂度。 By analyzing the period of the bit computation of AND, OR, and XOR, it is proved that the frequency characters of the bit computation of XOR is better than the original frequency characters. The study of the linear complexity of the combined bits demonstrates that: the linear complexity of the bit computation of AND and OR is equal to the product of the linear complexity of the originals; and the linear complexity of the bit computation of XOR equal to the addition of the linear complexity of the originals. Computer simulation demonstrates that the combined pseudorandom sequence generator has simple architecture and high speed information processing characters, and can efficiently increase the period and linear complexity efficiently of pseudorandom sequence.
作者 张传武
出处 《电子科技大学学报》 EI CAS CSCD 北大核心 2008年第5期716-719,共4页 Journal of University of Electronic Science and Technology of China
基金 国家自然科学基金(60603009)
关键词 细胞自动机 组合伪随机序列发生器 密码学 线性复杂度 统计特性 cellular automata (CA) combined pseudorandom sequence generator (CPRSG) cryptography linear complexity statistical properties
  • 相关文献

参考文献10

  • 1GUAN S U, TAN S K. Pseudorandom number generation with self-programmable cellular automata[J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2004, 23(7): 1095-1101.
  • 2PIERRE L E. Efficient and portable combined random number generators[J]. Communications of the ACM, 1988, 31(6): 742-774.
  • 3ROSIN P L. Training cellular automata for image processing [J]. IEEE Transactions on Image Processing, 2006, 15(7): 2076-2087.
  • 4TOMASSINI M, SIPPER M, PERRENOUD M. On the generation of high-quality random numbers by two-dimensional cellular automata[J]. IEEE Transactions on Computers, 2000, 49(10): 1146-1151.
  • 5张传武,沈野樵,彭启琮.细胞自动机反向迭代加密技术研究[J].计算机学报,2004,27(1):125-129. 被引量:22
  • 6张传武.加性细胞自动机的同构性分析[J].电子科技大学学报,2006,35(5):774-776. 被引量:2
  • 7RAINER A R, OTHMAR J S. Products of linear recurring sequences with maximum complexity[J]. IEEE Transactions on Information Theory, 1987, IT-33(1): 124-131.
  • 8万哲先著.代数和编码[M].北京:科学出版社,1980.285.
  • 9CHO S J, CHOI U S, KIM H D, et al. New synthesis of one-dimensional 90/150 linear hybrid group cellular automata[J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2007, 126(9): 1720-1724.
  • 10NIST. FIPS PUB 140-2 security requirements for cryptographic modules[S]. 1999.

二级参考文献18

  • 1万哲先著.代数和编码[M].北京:科学出版社,1980.285.
  • 2Wolfram S.. Cryptography with cellular automata, advances in cryptology. In: Crypto'85 Proceedings, LNCS, 218, Berlin:Springer-Verlag, 1986. 429~432
  • 3Guan P.. Cellular automata public-key cryptosystems. Complex Systems, 1987, 1:51~57
  • 4Nandi S. , Kar B. K. , Chaudhuri P. Pal. Theory and applications of cellular automata in cryptography. IEEE Transactions on Computers, 1994, 43(12) :1346~1356
  • 5Habutsu Toshiki, Nishio Yoshifumi, Sasase Iwao, Mori Shin saku. A secret key cryptosystem using a chaotic map. The Transactions of the IEICE, 1990, E73(7):1041~1044
  • 6Wolfram S.. University and complexity in cellular automata.Physica D, 1984, 10(1):1~35
  • 7Wolfram S.. Origins of randomness in physical system. Physical Review Letters, 1985, 55(5) :449~452
  • 8Farmer D. , Toffoli T. , Wolfram S.. Cellular automata. Los Alamos Science, 1983, 9:2~21
  • 9Wolfram S.. Statistical mechanics of cellular automata. Reviews of Modern Physics, 1983, 55(3) :601~644
  • 10Gutowitz H. , Victor J. D. , Knight B. W.. Local structure theory for cellular automata, Physica D, 1987,28:18~48

共引文献36

同被引文献16

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部