Cited by 55Chaos-based Image/Signal EncryptionComputer Science and EngineeringAdvanced Steganography and Watermarking Techniques

A Novel Image Encryption Algorithm Based on a Fractional-Order Hyperchaotic System and DNA Computing

Open access
Li, Taiyong, Yang, Minggao, Wu, Jiang, Jing, Xin·2017·Complexity

Abstract

In the era of the Internet, image encryption plays an important role in information security. Chaotic systems and DNA operations have been proven to be powerful for image encryption. To further enhance the security of image, in this paper, we propose a novel algorithm that combines the fractional-order hyperchaotic Lorenz system and DNA computing (FOHCLDNA) for image encryption. Specifically, the algorithm consists of four parts: firstly, we use a fractional-order hyperchaotic Lorenz system to generate a pseudorandom sequence that will be utilized during the whole encryption process; secondly, a simple but effective diffusion scheme is performed to spread the little change in one pixel to all the other pixels; thirdly, the plain image is encoded by DNA rules and corresponding DNA operations are performed; finally, global permutation and 2D and 3D permutation are performed on pixels, bits, and acid bases. The extensive experimental results on eight publicly available testing images demonstrate that the encryption algorithm can achieve state-of-the-art performance in terms of security and robustness when compared with some existing methods, showing that the FOHCLDNA is promising for image encryption.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1155/2017/9010251

Cites

40 of 40 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Classical hybrid cryptosystems combine a symmetric image cipher with asymmetric key transport such as ElGamal, ECC, Hill cipher variants or RSA, all of which are broken in polynomial time by Shor's algorithm.

    “Second, classical hybrid cryptosystems [32][33][34][35][36][37][38] consist of a combination of a symmetric image cypher and asymmetric key transport, which is either ElGamal, ECC, Hill cypher variants or RSA; all of which are the weakest links broken in polynomial time by Shor's algorithm.”

    From A hybrid encryption algorithm based on AES and Kyber for secure image protection in the post-quantum era (2026) · cites this paper as [33]

    The Introduction mentions a symmetric image-encryption scheme, while §4.2 discusses the proposed algorithm’s secret keys. Neither passage addresses hybrid cryptosystems, asymmetric key transport, or Shor’s algorithm; searches for those terms and the named algorithms found no supporting passage in our copy. (LLM, conf=0.76)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 4

  1. B. Schneier, Applied Cryptography: Protocols, Algorithms, and Source Code in C, John Wiley and Sons, Indianapolis, IN, USA, 2015.
  2. G. Chen and X. Dong, From Chaos to Order: Methodologies, Per- spectives, and Applications, Series on Nonlinear Science, World Scientific, 1998.
  3. X. Wang and H. Zhang, "A novel image encryption algorithm based on genetic recombination and hyper-chaotic systems, " Nonlinear Dynamics, vol. 1, pp. 333-346, 2016.
  4. D. R. Stinson, Cryptography: Theory and Practice, CRC Press, 2005.

Cited by

Sorted by citations

Authors
Li, T., Yang, M., Wu, J., & Jing, X.
Affiliations
Southwestern University of Finance and Economics (CN)
Corresponding author
Li, Taiyong
Venue
Complexity
Publisher
Wiley
Published
2017
Volume
2017
Pages
1-13
ISSN
  • 1076-2787 (ISSN-L)
  • 1099-0526
OpenAlex
W2770106662
Cited by
55
References
40
Citations by year
2026: 3 · 2025: 2 · 2024: 2 · 2023: 3 · 2022: 7 · 2021: 12 · 2020: 13 · 2019: 9 · 2018: 4
FWCI
2.95
Type
journal article
Language
en
Open access
Locations
  • Complexity (publishedVersion, cc-by)
  • RePEc: Research Papers in Economics (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
  • National Natural Science Foundation of China (91218301, JBK170944, JBK170505, JBK130503, 71473201, 17ZB0433)
  • Fundamental Research Funds for the Central Universities (91218301, JBK170944, JBK170505, JBK130503, 71473201, 17ZB0433)
  • Education Department of Sichuan Province (91218301, JBK170944, JBK170505, JBK130503, 71473201, 17ZB0433)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
  • Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Steganography and Watermarking Techniques
Keywords
image encryption, DNA computing, pseudorandom sequence generation, diffusion schemes, pixel permutation, chaos-based cryptography, information security

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review