• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

基于超混沌的双图关联加密。

Double graph correlation encryption based on hyperchaos.

机构信息

School of Computer Science and Engineering, Northeastern University, Shenyang, China.

School of Electrical Engineering and Computer Science, University of Missouri, Columbia, Missouri, United States of America.

出版信息

PLoS One. 2023 Sep 28;18(9):e0291759. doi: 10.1371/journal.pone.0291759. eCollection 2023.

DOI:10.1371/journal.pone.0291759
PMID:37768960
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC10538788/
Abstract

Preventing unauthorized access to sensitive data has always been one of the main concerns in the field of information security. Accordingly, various solutions have been proposed to meet this requirement, among which encryption can be considered as one of the first and most effective solutions. The continuous increase in the computational power of computers and the rapid development of artificial intelligence techniques have made many previous encryption solutions not secure enough to protect data. Therefore, there is always a need to provide new and more efficient strategies for encrypting information. In this article, a two-way approach for information encryption based on chaos theory is presented. To this end, a new chaos model is first proposed. This model, in addition to having a larger key space and high sensitivity to slight key changes, can demonstrate a higher level of chaotic behavior compared to previous models. In the proposed method, first, the input is converted to a vector of bytes and first diffusion is applied on it. Then, the permutation order of chaotic sequence is used for diffusing bytes of data. In the next step, the chaotic sequence is used for applying second diffusion on confused data. Finally, to further reduce the data correlation, an iterative reversible rule-based model is used to apply final diffusion on data. The performance of the proposed method in encrypting image, text, and audio data was evaluated. The analysis of the test results showed that the proposed encryption strategy can demonstrate a pattern close to a random state by reducing data correlation at least 28.57% compared to previous works. Also, the data encrypted by proposed method, show at least 14.15% and 1.79% increment in terms of MSE and BER, respectively. In addition, key sensitivity of 10-28 and average entropy of 7.9993 in the proposed model, indicate its high resistance to brute-force, statistical, plaintext and differential attacks.

摘要

防止未经授权访问敏感数据一直是信息安全领域的主要关注点之一。因此,已经提出了各种解决方案来满足这一要求,其中加密可以被认为是最早和最有效的解决方案之一。计算机计算能力的不断提高和人工智能技术的快速发展使得许多以前的加密解决方案不足以保护数据的安全。因此,总是需要提供新的和更有效的策略来加密信息。在本文中,提出了一种基于混沌理论的双向信息加密方法。为此,首先提出了一种新的混沌模型。与以前的模型相比,该模型除了具有更大的密钥空间和对密钥细微变化的高度敏感性外,还可以表现出更高水平的混沌行为。在所提出的方法中,首先将输入转换为字节向量,并首先对其进行扩散。然后,使用混沌序列的置换顺序对数据的字节进行扩散。在下一个步骤中,使用混沌序列对混淆数据应用二次扩散。最后,为了进一步降低数据相关性,使用基于迭代可逆规则的模型对数据应用最终扩散。评估了所提出的方法对图像、文本和音频数据的加密性能。测试结果的分析表明,与以前的工作相比,通过减少数据相关性,所提出的加密策略可以表现出至少 28.57%接近随机状态的模式。此外,所提出的方法加密的数据在 MSE 和 BER 方面分别至少增加了 14.15%和 1.79%。此外,在提出的模型中,密钥灵敏度为 10-28,平均熵为 7.9993,表明其对暴力、统计、明文和差分攻击具有很高的抵抗力。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/15398ebad262/pone.0291759.g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/ffff73d2bdc5/pone.0291759.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/1933c15d9206/pone.0291759.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/ca1f4632ea34/pone.0291759.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/ca5a5677b830/pone.0291759.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/ed0cf47807b9/pone.0291759.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/19fa8d9d5378/pone.0291759.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/183472207dcd/pone.0291759.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/26c5f99794fe/pone.0291759.g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/4eae5b683ba8/pone.0291759.g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/da3311ca7816/pone.0291759.g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/79b32b7b3012/pone.0291759.g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/15398ebad262/pone.0291759.g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/ffff73d2bdc5/pone.0291759.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/1933c15d9206/pone.0291759.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/ca1f4632ea34/pone.0291759.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/ca5a5677b830/pone.0291759.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/ed0cf47807b9/pone.0291759.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/19fa8d9d5378/pone.0291759.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/183472207dcd/pone.0291759.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/26c5f99794fe/pone.0291759.g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/4eae5b683ba8/pone.0291759.g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/da3311ca7816/pone.0291759.g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/79b32b7b3012/pone.0291759.g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/7a67/10538788/15398ebad262/pone.0291759.g012.jpg

相似文献

1
Double graph correlation encryption based on hyperchaos.基于超混沌的双图关联加密。
PLoS One. 2023 Sep 28;18(9):e0291759. doi: 10.1371/journal.pone.0291759. eCollection 2023.
2
Enhancing image security via chaotic maps, Fibonacci, Tribonacci transformations, and DWT diffusion: a robust data encryption approach.通过混沌映射、斐波那契、特里波那契变换和离散小波变换扩散增强图像安全性:一种稳健的数据加密方法。
Sci Rep. 2024 May 29;14(1):12277. doi: 10.1038/s41598-024-62260-3.
3
A new encryption algorithm for image data based on two-way chaotic maps and iterative cellular automata.一种基于双向混沌映射和迭代细胞自动机的图像数据加密新算法。
Sci Rep. 2024 Jul 19;14(1):16701. doi: 10.1038/s41598-024-64741-x.
4
A New Image Encryption Algorithm Based on Chaos and Secure Hash SHA-256.一种基于混沌与安全哈希算法SHA - 256的新型图像加密算法
Entropy (Basel). 2018 Sep 19;20(9):716. doi: 10.3390/e20090716.
5
A New Image Encryption Algorithm Based on Composite Chaos and Hyperchaos Combined with DNA Coding.一种基于复合混沌与超混沌结合DNA编码的新型图像加密算法
Entropy (Basel). 2020 Feb 2;22(2):171. doi: 10.3390/e22020171.
6
Image Encryption Using a New Hybrid Chaotic Map and Spiral Transformation.基于新型混合混沌映射和螺旋变换的图像加密
Entropy (Basel). 2023 Nov 5;25(11):1516. doi: 10.3390/e25111516.
7
A Simple Chaotic Map-Based Image Encryption System Using Both Plaintext Related Permutation and Diffusion.一种基于简单混沌映射的图像加密系统,该系统同时使用与明文相关的置换和扩散。
Entropy (Basel). 2018 Jul 18;20(7):535. doi: 10.3390/e20070535.
8
Secure image communication based on two-layer dynamic feedback encryption and DWT information hiding.基于双层动态反馈加密和 DWT 信息隐藏的安全图像通信。
PLoS One. 2024 Aug 27;19(8):e0300228. doi: 10.1371/journal.pone.0300228. eCollection 2024.
9
A Novel Hybrid Secure Image Encryption Based on the Shuffle Algorithm and the Hidden Attractor Chaos System.一种基于洗牌算法和隐藏吸引子混沌系统的新型混合安全图像加密方法。
Entropy (Basel). 2020 Jun 9;22(6):640. doi: 10.3390/e22060640.
10
A Chaotic-Based Encryption/Decryption Framework for Secure Multimedia Communications.一种用于安全多媒体通信的基于混沌的加密/解密框架。
Entropy (Basel). 2020 Nov 4;22(11):1253. doi: 10.3390/e22111253.

引用本文的文献

1
Retraction: Double graph correlation encryption based on hyperchaos.撤回:基于超混沌的双图相关加密。
PLoS One. 2024 Oct 14;19(10):e0312325. doi: 10.1371/journal.pone.0312325. eCollection 2024.

本文引用的文献

1
A New Algorithm for Digital Image Encryption Based on Chaos Theory.一种基于混沌理论的数字图像加密新算法。
Entropy (Basel). 2021 Mar 13;23(3):341. doi: 10.3390/e23030341.
2
Secure Image Encryption Algorithm Based on Hyperchaos and Dynamic DNA Coding.基于超混沌和动态DNA编码的安全图像加密算法
Entropy (Basel). 2020 Jul 15;22(7):772. doi: 10.3390/e22070772.