基于双混沌映射的通信信息安全存储多重加密  

Security storage and multiple encryption of communication information based on double chaotic mapping

作　　者：付鋆 刘俊荣 周泽元 FU Yun;LIU Jun-rong;ZHOU Ze-yuan(Guizhou Power Grid Co.,Ltd.,Information Center,Guiyang 550002,China)

机构地区：[1]贵州电网有限责任公司信息中心,贵阳550002

出　　处：《信息技术》2023年第7期87-91,共5页Information Technology

基　　金：南方电网有限责任公司科技项目(066700KK52190020)。

摘　　要：现有的信息安全存储加密方法在计算节点位置参数时算法冗余度较大、加密速度较慢,为此,提出基于双混沌映射的通信信息安全存储多重加密方法。建立通信信息路径节点覆盖集,遍历二叉树节点,模拟所有随机变量的算法执行过程;依据双混沌映射计算各节点位置参数,通过置乱函数变换矩阵中位置参数,编码各节点动态位置信息;设计通信信息存储加密算法,计算各节点信息复杂度,实现通信信息安全存储多重加密。实验结果表明,密文长度为160kB时,该方法存储加密所需要的总时间仅为188ms,这表明文中方法具有较高存储效率。The existing information security storage encryption methods have large algorithm redundancy and slow encryption speed when calculating node location parameters.Therefore,a multiple encryption method for communication information security storage based on double chaotic mapping is proposed.The coverage set of communication information path nodes is established to traverse the binary tree nodes,and simulate the algorithm execution process of all random variables.The position parameters of each node are calculated according to the double chaotic mapping,and the dynamic position information of each node is encoded by scrambling the position parameters in the function transformation matrix.Then,communication information storage encryption algorithm is designed to calculate the information complexity of each node,and realize multiple encryption of communication information security storage.The experiment results show that when the ciphertext length is 160kB,the total storage and encryption time of this method is only 188ms,which shows that this method has high storage efficiency.

关 键 词：双混沌映射 通信信息 多重加密 二叉树 变换矩阵 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]