{"id":"febf854b-5a17-4fb0-82cd-b3cad76ce853","arxiv_id":"2411.17643","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"high","formal_verification":"none","parameter_count":9,"one_line_summary":"The paper introduces a new 4-D hyperchaotic system for an ECC-based image encryption scheme, but the scheme is underspecified and uses an insecure ECC prime.","lead":"The paper describes a new 4-D hyperchaotic system and uses it in an image encryption scheme that also employs elliptic curve cryptography. The authors report security metrics for a single test image, but the algorithm is not fully specified and the ECC parameters are too small for real security.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The scheme's only hard cryptographic primitive is broken: Table I uses EC prime p=123457 (17 bits), so ECDLP key recovery is computationally trivial and the claimed large key space / robustness is unsupported.","rationale":"The paper's central claim is robust image encryption; it depends on (1) the system being hyperchaotic and (2) the ECC layer providing a strong one-way function. Condition (2) is the least secure: the selected curve over F_123457 is only 17 bits, so ECDLP is computationally trivial. Because the private key is listed in Table I, the break can be checked directly. I do not see outside evidence (code, formal proof) that would rescue the claim; the hyperchaotic system's Lyapunov exponents and sensitivity plots are internal simulations, not independent verification. I agree with the reader's weakest_assumption. The NPCR formula inconsistency (Eq. 22) is an additional internal contradiction that makes the differential-attack results unreproducible, but the ECC weakness alone is decisive.","tokens_in":5664,"tokens_out":5136,"duration_ms":46205,"concrete_test":"Run baby-step giant-step on E(F_123457): y^2 = x^3 + 5376x + 2438, with G=(2225,75856) and PB=(30402,35513), to solve PB = kG. Also verify that yG with y=36548 equals PB. If the scalar is recovered in under a second, the ECC parameters in Table I are practically broken and the Section IV-B ECDLP-hardness / large-key-space claim is falsified.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The most load-bearing assumption is the claim in Section IV-B that the ECC layer 'provides an exponentially difficult ECDLP with respect to the key size' and that the key size is 'quite large.' Table I selects p=123457, a 17-bit prime. The curve E: y^2 = x^3 + 5376x + 2438 over F_123457 has group order around 123,456, so a Pollard-rho or baby-step giant-step attack recovers any private scalar in a few hundred group operations. An attacker who recovers the private key y=36548 from G=(2225,75856) and PB=(30402,35513) can use Eq. (13) to decrypt every ciphertext. The robust-encryption claim therefore fails at the ECC layer, independently of whether the new 4-D system is truly hyperchaotic. A separate reproducibility problem reinforces the rejection: the NPCR definition in Eq. (22) sets D=0 in both branches, which would yield NPCR=0 rather than the reported ~99.6%; as written, the differential-attack numbers cannot follow from the stated formula.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","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.","tokens_in":5928,"tokens_out":4873,"duration_ms":40380,"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":[{"comment":"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":"Section IV-B, Table I"},{"comment":"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":"Section IV-E, Eq. (22)"},{"comment":"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.","section":"Section III"}],"minor_comments":[{"comment":"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)).","section":"Section IV-D, Eq. (17)"},{"comment":"The first entry '09424' should be '0.9424'.","section":"Table II"},{"comment":"The text refers to the 'chipper image'; this should be 'cipher image'.","section":"Section IV-E"},{"comment":"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.","section":"Section IV-F"}],"recommendation":"reject","confidential_remarks":null},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: the proposed 4-D hyperchaotic system is a legitimately constructed example of the Li et al. state-feedback method applied to Luo et al.'s 3-D system, and the Lyapunov/equilibrium analysis is standard. But the paper's central claim—that the ECC-based encryption is robust—collapses. Table I uses p=123457, a 17-bit prime; the discrete log on that curve is computationally trivial, so the 'quite large' key space claim is simply wrong. On top of that, Eq. (22) defines D(i,j)=0 in both branches, which makes the reported NPCR ~99.6% impossible. That is an internal contradiction, not a minor typo. And the actual encryption algorithm is never specified in the text; the flowcharts and sparse ECC formulas are not enough to reproduce the ciphertext.\n\nWhat earns credit: the authors are transparent about their construction—they cite Li, Luo, and Soleymani—and the chaos part (Lyapunov exponents, no-equilibrium argument, sensitivity) is executed cleanly. The histogram and correlation plots look typical for a confusion-diffusion scheme, though without a complete algorithm those results can't be independently checked.\n\nSoft spots in proportion: the ECC parameter problem is fatal to the security claim; the NPCR formula inconsistency is equally damaging. The missing algorithm specification is a reproducibility problem that would need fixing even if the crypto were sound. Minor: the paper repeats the abstract in the introduction, and Section IV-B's claim about ECDLP is unquantified.\n\nWho this is for: researchers cataloguing chaotic systems might find system (1) worth a look, but nobody should build on the encryption scheme. I would not send this to peer review as-is; the load-bearing errors are too central. If the authors resubmit, they need a real key size (e.g., 256-bit prime), a corrected NPCR/UACI definition, and a full step-by-step algorithm.","headline":"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.","tokens_in":6386,"tokens_out":3330,"would_cite":false,"duration_ms":30509,"reading_group":"maybe","serious_thinker":"no","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["94A60","37D45"],"pacs":[],"model":"deepseek-v4-flash","headline":"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.","keywords":["4-D hyperchaotic system","image encryption","elliptic curve cryptography","confusion-diffusion","hidden attractor","Lyapunov exponents","NPCR/UACI","differential attack"],"falsifier":"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.","tokens_in":20,"feed_emoji":"🔐","tokens_out":7715,"duration_ms":182888,"temperature":0.7,"pith_summary":"The paper constructs a new four-dimensional hyperchaotic system by adding linear state feedback to a known three-dimensional chaotic system, and shows it has two positive Lyapunov exponents and no equilibrium points. It then embeds this system in an existing elliptic-curve-cryptography mapping scheme to encrypt color images through confusion and diffusion. The reported experiments on a 256x256 Peppers image show uniform histograms, near-zero adjacent-pixel correlation, and NPCR/UACI values close to the ideal thresholds for differential resistance. The authors claim these results make the crypto-system robust against statistical, differential, and data-loss attacks while remaining simple to implement.","feed_headline":"4-D hyperchaos plus elliptic curve drives new image cipher","feed_subtitle":"Confusion-diffusion encryption reaches near-ideal NPCR and UACI scores on color images.","key_machinery":"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.","core_discovery":"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.","pith_inferences":["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."],"forward_implications":["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."],"supporting_citations":[{"why":"Supplies the 3-D chaotic system that the proposed 4-D system extends.","marker":"[10]"},{"why":"Provides the state-feedback method for generating hyperchaos from a lower-dimensional system.","marker":"[11]"},{"why":"Wolf algorithm used to compute the Lyapunov exponents that certify hyperchaos.","marker":"[12]"},{"why":"The existing elliptic-curve mapping scheme that the hyperchaotic system is incorporated into.","marker":"[8]"},{"why":"Provides the ECDLP hardness assumption and an improved ECC image encryption baseline that motivates the design.","marker":"[9]"}],"fun_headline_variants":["Hyperchaos + ECC yields near-ideal image encryption","4-D hidden-attractor cipher hits 99.6% NPCR","No-equilibrium chaos boosts image cipher security","Elliptic curve plus 4-D chaos: robust image cipher","Confusion-diffusion with hyperchaos nears ideal UACI"],"cache_read_input_tokens":8704,"weakest_assumption_plain":"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.","fun_headline_variants_meta":{"raw":{"variants":["Hyperchaos + ECC yields near-ideal image encryption","4-D hidden-attractor cipher hits 99.6% NPCR","No-equilibrium chaos boosts image cipher security","Elliptic curve plus 4-D chaos: robust image cipher","Confusion-diffusion with hyperchaos nears ideal UACI"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000157,"raw_usage":{"total_tokens":1177,"prompt_tokens":857,"completion_tokens":320,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":473,"completion_tokens_details":{"reasoning_tokens":234}},"tokens_in":473,"tokens_out":320,"duration_ms":3370,"temperature":1.0,"reasoning_tokens":234,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T11:52:27.916195+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"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.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the 3-D chaotic system that the proposed 4-D system extends."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the state-feedback method for generating hyperchaos from a lower-dimensional system."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Wolf algorithm used to compute the Lyapunov exponents that certify hyperchaos."},{"cited_title":"Soleymani, M","cited_arxiv_id":null,"evidence_quote":"The existing elliptic-curve mapping scheme that the hyperchaotic system is incorporated into."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the ECDLP hardness assumption and an improved ECC image encryption baseline that motivates the design."}],"review_version":1}