检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:昝卫博 王海珍[2,3] ZAN Weibo;WANG Haizhen(Digital Horsepower(Zhengzhou)Information Technology Co.,Ltd,Zhengzhou 450003,China;School of Computer and Control Engineering,Qiqihar University,Qiqihar 161006,China;Heilongjiang Key Laboratory of Big Data Network Security Detection and Analysis,Qiqihar University,Qiqihar 161006,China)
机构地区:[1]数字马力(郑州)信息技术有限公司,河南郑州450003 [2]齐齐哈尔大学计算机与控制工程学院,黑龙江齐齐哈尔161006 [3]齐齐哈尔大学黑龙江省大数据网络安全检测分析重点实验室,黑龙江齐齐哈尔161006
出 处:《高师理科学刊》2024年第6期38-42,共5页Journal of Science of Teachers'College and University
基 金:2023年度黑龙江省属高等学校基本科研业务项目(145209126)。
摘 要:随着加密算法被广泛应用,高级加密标准(Advanced Encryption Standard,AES)轮密钥之间具有强关联性的缺点也被发现.提出了一种基于Tent映射和Bernouli映射的改进AES算法,使用两种混沌映射产生的随机序列生成轮密钥,对原始的密钥扩展算法进行改进和优化,该方法生成的轮密钥之间无关联性,密钥空间足够大,并且每次生成的序列及轮密钥都不同,增强了AES抵御攻击的能力.通过对随机序列的安全测试分析,表明改进后的AES能够保证密钥扩展算法有足够的安全性,解决了轮密钥关联性的问题,并实现了一次一密的效果.As encryption algorithms are widely used,the drawback of strong correlation between advanced encryption standard(AES)round keys has been discovered.An improved AES algorithm based on Tent mapping and Bernouli mapping is proposed,which uses the random sequences generated by the two chaotic mappings to generate round keys,and improves and optimizes the original key expansion algorithm.There is no correlation between the round keys generated by this method,and the key space is very large.The sequences and round keys generated each time are different,which enhances the ability of AES to resist attacks.Through security testing and analysis of random sequences,it was found that the improved AES can ensure the key expansion algorithm has enough security,solves the problem of round key correlation,and achieves the effect of one secret at a time.
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7