一种基于Logistic混沌序列的二叉树遍历置乱方法  

A scrambling method of binary-tree traversal based on Logistic chaotic sequences

作　　者：王锦涛[1] 田东平[1] 

机构地区：[1]西安邮电学院信息安全研究中心,陕西西安710121

出　　处：《西安邮电学院学报》2010年第1期119-122,共4页Journal of Xi'an Institute of Posts and Telecommunications

摘　　要：提出一种基于Logistic混沌序列的二叉树遍历置乱方法,对该方法的原理进行了阐述,并对密钥敏感性进行测试,对置乱后的图像进行剪切、加噪等处理,实验结果表明本算法具有较好的密钥敏感性以及一定的鲁棒性。A scrambling method of binary-tree traversal based on Logistic chaotic sequences is proposed.The principle of this method is expounded,and the sensitivity with respect to the secret key is tested.The scrambled image is processed with cropping and Gaussian noise.The result shows that this method has good sensitivity with respect to the secret key and a certain robustness.

关 键 词：LOGISTIC混沌序列 二叉树遍历 置乱 

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