A Hierarchical Data Encryption Algorithm Based on Iteration

Wanbo Yu, Fei Duan
{"title":"A Hierarchical Data Encryption Algorithm Based on Iteration","authors":"Wanbo Yu, Fei Duan","doi":"10.1109/CISCE58541.2023.10142263","DOIUrl":null,"url":null,"abstract":"In recent years, the application of chaos in the field of encryption is increasing. The chaotic characteristics of chaotic sequences make the encryption effect greatly improved compared with other encryption methods, mainly in encryption time, space and security. This paper mainly applies chaotic system to encrypt data stream hierarchically and continuously. Layers can be modified according to different scenarios, keys are one-dimensional arrays. At the beginning, use the function to generate the KEY1. Generate KEY2 using random function. KEY1. and KEY2 iterate to generate a new key END1 to encrypt the first layer of data. Using the encrypted first layer data as the KEY3. KEY3 and KEY2 iterate to generate a new key END2 to encrypt the next layer of data. Repeat the above operations to achieve hierarchical continuous encryption of data, the key also changes with the content. The encryption time, key space, anti-attack performance and various encryption indexes of the algorithm are analyzed by experiments. It is proved that the algorithm is an encryption method suitable for various situations, with small storage space, energy saving and high security.","PeriodicalId":145263,"journal":{"name":"2023 5th International Conference on Communications, Information System and Computer Engineering (CISCE)","volume":"29 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 5th International Conference on Communications, Information System and Computer Engineering (CISCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISCE58541.2023.10142263","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In recent years, the application of chaos in the field of encryption is increasing. The chaotic characteristics of chaotic sequences make the encryption effect greatly improved compared with other encryption methods, mainly in encryption time, space and security. This paper mainly applies chaotic system to encrypt data stream hierarchically and continuously. Layers can be modified according to different scenarios, keys are one-dimensional arrays. At the beginning, use the function to generate the KEY1. Generate KEY2 using random function. KEY1. and KEY2 iterate to generate a new key END1 to encrypt the first layer of data. Using the encrypted first layer data as the KEY3. KEY3 and KEY2 iterate to generate a new key END2 to encrypt the next layer of data. Repeat the above operations to achieve hierarchical continuous encryption of data, the key also changes with the content. The encryption time, key space, anti-attack performance and various encryption indexes of the algorithm are analyzed by experiments. It is proved that the algorithm is an encryption method suitable for various situations, with small storage space, energy saving and high security.
基于迭代的分层数据加密算法
近年来,混沌在加密领域的应用越来越多。混沌序列的混沌特性使得其加密效果与其他加密方法相比有了很大的提高,主要体现在加密时间、空间和安全性方面。本文主要应用混沌系统对数据流进行分层连续加密。层可根据不同场景修改,键为一维数组。开始时,使用该函数生成KEY1。使用随机函数生成KEY2。KEY1。和KEY2迭代生成一个新的密钥END1来加密第一层数据。使用加密的第一层数据作为KEY3。KEY3和KEY2迭代生成一个新的密钥END2来加密下一层数据。重复以上操作即可实现数据的分层连续加密,密钥也随内容而变化。通过实验分析了该算法的加密时间、密钥空间、抗攻击性能和各种加密指标。实践证明,该算法是一种适用于各种情况的加密方法,具有存储空间小、节能、安全性高等特点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信