4.7 Article

A real-time one-time pad DNA-chaos image encryption algorithm based on multiple keys

期刊

OPTICS AND LASER TECHNOLOGY
卷 143, 期 -, 页码 -

出版社

ELSEVIER SCI LTD
DOI: 10.1016/j.optlastec.2021.107359

关键词

Image encryption; Multiple keys; DNA coding; Chaos

资金

  1. National Key R&D Program of China [2018YFC0910500]
  2. National Natural Science Foundation of China [61425002, 61751203, 61772100, 61972266, 61802040, 61672121, 61572093]
  3. Program for Changjiang Scholars and Innovative Research Team in University [IRT_15R07]
  4. Program for Liaoning Innovative Research Team in University [LT2017012]
  5. Natural Science Foundation of Liaoning Province [20180551241, 2019-ZD0567]
  6. High-level Talent Innovation Support Program of Dalian City [2017RQ060, 2018RQ75]
  7. Dalian Outstanding Young Science and Technology Talent Support Program [2017RJ08]
  8. Scientific Research Fund of Liaoning Provincial Education Department [JYT19051]

向作者/读者索取更多资源

The study introduces a real-time one-time pad DNA-chaos image encryption algorithm using multiple keys, which is simple, fast, has a large key space, and is resistant to performance attacks.
Image encryption is an important necessity when sharing data over public networks, and many image encryption algorithms have been proposed for the task. However, most of these algorithms are complex and slow. We propose a real-time one-time pad DNA-chaos image encryption algorithm using multiple keys. The proposed encryption algorithm uses a greatly simplified mechanism and a large, unpredictable sequence to encrypt the image. Our algorithm has three main advantages. First, its reliance on the original image for four of the keys makes it sensitive to changes in the original image. Small changes in the image produce large changes in the keys, making the algorithm resistant to differential attacks. Second, we integrate the natural DNA sequence into the process of generating the key, and the algorithm uses the massive DNA sequences stored in the DNA gene bank to solve the problem that it is difficult to store one-time pad. The keys have the property of one-time pad, and the key space is considerablely large. Finally, our algorithm encrypts quickly enough to make it suitable for real-time applications. On the premise of ensuring that the results of this paper are not worse than those of the comparison literature in other performance indicators, in terms of encryption time, even if we use a computing environment that is worse than all the comparison literature computer configurations, the algorithm of this paper can still save at least 14%-86%. As the picture size becomes larger, the advantages of the algorithm in this paper are more obvious.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据