REVIEW 3 major objections 4 minor 12 references
A robust image encryption scheme based on new 4-D hyperchaotic system and elliptic curve
T0 review · 3 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash
Pith's one-line read A newly built 4-D hyperchaotic system with two positive Lyapunov exponents is combined with an elliptic-curve mapping in a two-stage image cipher that reports near-ideal NPCR and UACI values.
desk verdict The 4-D chaos construction is fine but the ECC layer uses a 17-bit prime and the NPCR equation is self-contradictory, so the robustness claim is unsupported. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the 4-D autonomous system (1), which is formed by appending a linear state-feedback controller w to the second equation of a 3-D chaotic system; it is simple, containing eight terms and two nonlinearities, yet hyperchaotic for the given parameters. Two positive Lyapunov exponents computed via the Wolf algorithm certify hyperchaos, and the nonexistence of equilibrium points places it among hidden-attractor systems. The encryption pipeline couples this chaotic source in the confusion stage with an elliptic-curve mapping scheme in the diffusion stage, where the presumed hardness of the elliptic-curve discrete logarithm problem underwrites the key space claim.
What would settle it
Run a brute-force search over all possible private keys on the curve $y^{2}$ = $x^{3}$ + 5376x + 2438 over F_123457 and show that the public key PB=(30402,35513) yields the stated private key y=36548 in well under the claimed exponential time; this would directly refute the paper's 'exponentially difficult ECDLP' security claim.
Extended reading notes
Core claim
The central claim is that system (1), with parameters a=10, b=3, c=2.5, e1=12, e2=0.1, m=2, k=2, is hyperchaotic with Lyapunov exponents LE1=0.971, LE2=0.102, LE3=0, LE4=-8.819, and that it has no equilibrium points, hence hosts a hidden attractor. When this system is used in the confusion stage of an image cipher whose diffusion stage uses elliptic-curve point operations with a=5376, b=2438, p=123457, the scheme achieves NPCR of about 99.6% and UACI of about 33.4%, matching the ideal values for 256x256 images. The paper further claims high key sensitivity, an effectively large key space through ECDLP, and that the cipher survives significant data loss in the encrypted image.
Load-bearing premise
The security of the cipher depends on the elliptic-curve discrete logarithm being hard for the published parameters, but the prime p=123457 is only about 17 bits, so the private key can be recovered by brute force.
Editorial extensions
If this is right
- The hyperchaotic system, verified by two positive Lyapunov exponents, can serve as a pseudo-random sequence generator for other chaos-based ciphers beyond this specific ECC construction.
- If the ECC mapping is the security bottleneck, porting the same pipeline to a larger, standard curve should preserve the chaotic layer's statistical performance (near-uniform histograms, low correlation, near-ideal NPCR/UACI).
- The reported NPCR values around 99.6% and UACI around 33.4% indicate the cipher is close to the avalanche criterion for single-pixel plaintext changes, a concrete benchmark for differential attack resistance.
- The hidden-attractor property may hinder phase-space reconstruction attacks that rely on locating equilibria, potentially adding a practical obstacle for cryptanalysis.
Reading between the lines
- Editorial inference: the published elliptic-curve parameters use a prime p=123457 of only about 17 bits, so the claimed exponential ECDLP security does not hold for these parameters; the effective key space is small enough for brute-force recovery of the private key, meaning the overall scheme's security is far lower than the paper's key-space argument asserts.
- A direct extension would be to substitute a standard 256-bit curve into the same confusion-diffusion pipeline and re-run the NPCR/UACI tests; if the chaotic stage is the active security layer, the metrics should stay near-ideal, isolating the curve choice as the point of failure.
- The construction recipe—adding a linear state-feedback term to a 3-D chaotic system to get a hidden-attractor 4-D hyperchaotic system—is generic and could be applied to other 3-D systems, with two positive Lyapunov exponents serving as the selection criterion.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript proposes a new 4-D autonomous system with eight terms and two nonlinearities, claims it is hyper-chaotic with Lyapunov exponents 0.971, 0.102, 0, and -8.819, and asserts that it has a hidden attractor because it has no equilibrium points. The system is then combined with an existing elliptic curve cryptography (ECC) mapping scheme to encrypt images in two stages of confusion and diffusion. Simulation results on a 256x256 Peppers image are reported, including histograms, correlation coefficients, NPCR/UACI differential-attack metrics, key sensitivity, and data-loss robustness. The authors conclude that the crypto-system is robust and suitable for health-care, military, and entertainment applications.
Significance. If the claims were substantiated, the paper would offer a simple hyperchaotic system and a novel integration with ECC for image encryption, a topic of ongoing interest. The hyperchaotic system itself is simple, and the reported correlation coefficients in Table II are close to zero, which would be a positive sign for statistical security if the algorithm were fully specified. However, the paper contains load-bearing flaws: the ECC parameters are cryptographically trivial, the NPCR formula is self-contradictory, and the encryption algorithm is not described. These issues mean the central robustness claim is not established by the current manuscript.
major comments (3)
- [Section IV-B, Table I] The ECC prime p=123457 is only 17 bits. The claim that ECC provides an exponentially difficult Elliptic Curve Discrete Logarithm Problem 'with respect to the key size' is therefore false: a Pollard-rho or baby-step giant-step attack recovers the private scalar in about sqrt(p) ≈ 351 group operations, and the private key y=36548 can be trivially recovered from G=(2225,75856) and PB=(30402,35513). An attacker who obtains y can decrypt any ciphertext via Eq. (13), so the key-space and robustness claims collapse at the ECC layer.
- [Section IV-E, Eq. (22)] The definition of D(i,j) has both branches set to 0: one for equality and the other for inequality. Consequently NPCR in Eq. (20) is identically 0, contradicting the values around 99.6% reported in Table III. The formula should set D=1 when C2 differs from C1; as written, the differential-attack results cannot follow from the stated equations and the NPCR/UACI claim is unsupported.
- [Section III] The encryption/decryption algorithm is not specified in the text. Section III only references the flowcharts in Figures 4 and 5 and states that confusion and diffusion are used; it does not describe how the hyperchaotic system generates the keystream, how the ECC mapping in Eqs. (11)–(13) is applied to pixel values, or how the private/public keys enter the process. Without this specification the reported simulations are not reproducible and the security claims cannot be independently verified.
minor comments (4)
- [Section IV-D, Eq. (17)] The formula for the correlation coefficient is missing the division operator; it should read rx,y = E((x-E(x))(y-E(y))) / sqrt(D(x)D(y)).
- [Table II] The first entry '09424' should be '0.9424'.
- [Section IV-E] The text refers to the 'chipper image'; this should be 'cipher image'.
- [Section IV-F] The data-loss experiment reports qualitative findings only; a quantitative metric such as PSNR or SSIM would be needed to support the claim that a majority of the original information is retained.
Circularity Check
No significant circularity: the hyperchaotic claim rests on computed Lyapunov exponents, the ECC steps are standard textbook operations, and the security metrics are measured rather than derived from fitted inputs.
full rationale
The paper's derivation chain does not reduce to its own inputs. Hyperchaoticity is asserted from Lyapunov exponents (Eq. 4) computed with the Wolf algorithm [12] at stated parameters (Eq. 2); this is a numerical measurement, not a parameter fitted to the target conclusion. The ECC encryption/decryption formulas (Eqs. 11-16) are standard and are not adapted so that the security claim follows by definition. The NPCR/UACI, correlation, key-sensitivity, and data-loss results are simulation measurements presented after the fact, so they cannot be circular predictions. The paper cites prior work [10, 11] to motivate the system construction and [8, 9] for ECC, but none of these citations is self-referential or invoked to forbid alternatives in a load-bearing way. Several genuine non-circular defects exist and should be noted as correctness risks: the ECC prime p = 123457 in Table I is only about 17 bits, making the claimed 'quite large' key space and exponential ECDLP difficulty unsupported; and Eq. (22) as printed sets D = 0 in both branches, so the reported NPCR values near 99.6% cannot follow from the stated formula. These are internal-consistency and security-parameter problems, not instances of circular reasoning.
Assumptions & free parameters
free parameters (9)
- a =
10
- b =
3
- c =
2.5
- e1 =
12
- e2 =
0.1
- m =
2
- k =
2
- initial conditions =
(1,1,1,1)
- ECC prime p =
123457
assumptions (3)
- standard math The Wolf algorithm (Ref. [12]) correctly estimates the Lyapunov exponents of system (1).
- domain assumption Absence of equilibrium points implies a hidden attractor.
- domain assumption The elliptic curve discrete logarithm problem is hard for the chosen parameters.
Cite this review
Pith. "Pith review of A robust image encryption scheme based on new 4-D hyperchaotic system and elliptic curve." pith.science (2026). https://pith.science/paper/4YL3UGKF
@misc{pith2026241117643,
author = {Pith},
title = {Pith review of: A robust image encryption scheme based on new 4-D hyperchaotic system and elliptic curve},
year = {2026},
howpublished = {\url{https://pith.science/paper/4YL3UGKF}},
note = {Machine review of arXiv:2411.17643}
}
read the original abstract
In this work, a new 4-D hyperchaotic system for image encryption is proposed and its effectiveness is demonstrated by incorporating it into an existing Elliptic Curve Cryptography (ECC) mapping scheme. The proposed system is considered simple because it consists of eight terms with two nonlinearities. The system exhibits high sensitivity to initial conditions, which makes it suitable for encryption purposes. The two-stage encryption process, involving confusion and diffusion, is employed to protect the confidentiality of digital images. The simulation results demonstrate the effectiveness of the hyperchaotic system in terms of security and performance when combined with the ECC mapping scheme. This approach can be applied in various domains including healthcare, military, and entertainment to ensure the robust encryption of digital images.
Figures
Figures from the paper (5 more)
Reference graph
Works this paper leans on
-
[1]
Y . Zhang, ”The image encryption algorithm based on chaos and DNA computing,” Multimedia Tools and Applications, vol. 77, no. 16, pp. 21589-21615, 2018
work page 2018
-
[2]
S. Wang, Q. Peng, and B. Du, ”Chaotic color image encryption based on 4-D chaotic maps and DNA sequence,” Optics & Laser Technology, vol. 148, pp. 107753, 2022
work page 2022
-
[3]
N. Zhou, Y . Hu, L. Gong, and G. Li, ”Quantum image encryption scheme with iterative generalized Arnold transforms and quantum image cycle shift operations,” Quantum Information Processing, vol. 16, pp. 1-23, 2017
work page 2017
- [4]
-
[5]
Q. Lai, H. Zhang, P. D. K. Kuate, G. Xu, and X.-W. Zhao, ”Analysis and implementation of no-equilibrium chaotic system with application in image encryption,” Applied Intelligence, vol. 52, no. 10, pp. 11448- 11471, 2022
work page 2022
-
[6]
U. Zia, M. McCartney, B. Scotney, J. Martinez, M. AbuTair, J. Memon, and A. Sajjad, ”Survey on image encryption techniques using chaotic maps in spatial, transform and spatiotemporal domains,” International Journal of Information Security, vol. 21, no. 4, pp. 917- 935, 2022
work page 2022
-
[7]
B. Zolfaghari and T. Koshiba, ”Chaotic Image Encryption: State-ofthe- Art, Ecosystem, and Future Roadmap,” Applied System Innovation, vol. 5, no. 3, pp. 57, 2022
work page 2022
-
[8]
A. Soleymani, M. J. Nordin, A. N. Hoshyar, Z. M. Ali, and E. Sundararajan, ”An image encryption scheme based on elliptic curve and a novel mapping method,” International Journal of Digital Content Technology and its Applications, vol. 7, no. 13, pp. 85, 2013
work page 2013
Show all 12 references
-
[9]
P. N. Lone, D. Singh, V . Stoffov ´a, D. C. Mishra, U. H. Mir, and N. Kumar, ”Cryptanalysis and Improved Image Encryption Scheme Using Elliptic Curve and Affine Hill Cipher,” Mathematics, vol. 10, no. 20, pp. 3878, 2022
2022
-
[10]
X. Luo, C. Wang, and Z. Wan, ”Grid multi-wing butterfly chaotic attractors generated from a new 3-D quadratic autonomous system,” Nonlinear Analysis: Modelling and Control, vol. 19, no. 2, pp. 272- 285, 2014
2014
-
[11]
Y . Li, W. K. Tang, and G. Chen, ”Generating hyperchaos via state feedback control,” International Journal of Bifurcation and Chaos, vol. 15, no. 10, pp. 3367-3375, 2005
2005
-
[12]
A. Wolf, J. B. Swift, H. L. Swinney, and J. A. Vastano, ”Determining Lyapunov exponents from a time series,” Physica D: Nonlinear Phenom- ena, vol. 16, no. 3, pp. 285-317, 1985
1985
Reviewed August 12, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.