摘要
针对地图的存储特性 ,提出了一个混沌序列加密算法 该算法首先用单向Hash函数把密钥散列为混沌映射的迭代初值 ,混沌序列经过数次迭代后才开始取用 ;然后将迭代生成的混沌序列值映射为ASCII码后与地图数据逐字节进行异或运算 考虑到实际计算中的有限精度效应 ,随步长改变混沌映射参数 采用实际的地图数据 ,经与DES及A5算法的比较表明 ,该算法效率高、保密性好。
Concerning the storage characteristics of digital map, a chaotic sequence encryption algorithm is presented. The user's key is first hashed as the seed of chaotic mapping by a Hash function. After several iteration steps, the chaotic sequences are mapped to ASCII codes, and using the ASCII codes to one by one XOR every byte of the map data. In order to avoiding the localization of the finite precision, we change the parameter of the chaotic mapping with step length. Comparing with DES and A5 algorithms, computing results show that our algorithm is fairly good in efficiency, security and simplicity.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
北大核心
2004年第2期238-242,共5页
Journal of Computer-Aided Design & Computer Graphics
基金
国家自然科学基金 (60 2 73 0 16)
国家"八六三"高技术研究发展计划(2 0 0 1AA14 2 110 )
中国科学院计算技术研究所基金 (2 0 0 162 5 0 )资助