The research team, led by Ahmed Kamal of Alexandria University together with H. A. El-Kamchochi, Adel El-Fahar, and Esam A. A. Hagras of Delta University for Science and Technology, calls the framework CCEC-SIE, short for Chaotic Complex Elliptic Curve-based Secure Image Encryption. The scheme’s central innovation is deceptively simple: instead of defining elliptic curves over ordinary prime fields, the researchers define them over Gaussian primes, complex numbers of the form c plus di whose norm equals an ordinary prime. Because each coordinate in such a field is itself a complex number, the number of available points on the curve grows quadratically, expanding the cryptographic space without requiring larger primes or heavier computation.

The mathematics behind this expansion follows directly from Hasse’s theorem, which bounds the number of points on an elliptic curve over a finite field. For a rational prime p, the field contains roughly p elements, but a Gaussian prime built from the same p yields a field of order p squared. In a worked example using the curve y squared equals x cubed plus x plus 1 over the prime 7, the rational version produces a modest set of points, while the Gaussian extension yields 55 points, comfortably within the Hasse bound of 36 to 64 for a field of order 49. Scaled to cryptographic sizes, this means a 256-bit parameter effectively doubles the key space, a gain achieved with the same curve equation and no increase in prime size.

Key exchange in the scheme adapts the classical ElGamal protocol to this Gaussian domain. The sender picks a random ephemeral key, computes two cipher points on the curve, and transmits them to the receiver, who recovers the shared secret using a private scalar. Because every point coordinate carries both real and imaginary components, the resulting shared key is itself a complex number, which then seeds the entire encryption pipeline. The authors demonstrate the protocol with complete numerical examples, showing that the receiver’s recovered point matches the sender’s original plaintext point exactly, confirming the algebraic correctness of the construction.

Once the shared key is established, the scheme turns to chaos theory for bulk encryption. Classical one-dimensional chaotic maps such as the Logistic and Tent maps are workhorses of image encryption, but they suffer from well-documented weaknesses: restricted chaotic ranges, non-uniform output distributions, periodic windows, and vulnerability to parameter estimation attacks. The researchers address these flaws by splitting each map’s control parameter into a primary value and a dynamically selected coefficient derived from the secret key, then applying a modulo-1 operation to keep iterations bounded. The resulting Iterative Logistic Map and Iterative Tent Map sustain chaotic behavior across a parameter interval roughly ten times wider than their classical counterparts, with Lyapunov exponents remaining positive throughout the operating range. The enhanced maps also passed the full NIST SP800-22 randomness test suite over a thousand independent iterations on million-bit sequences.

These chaotic sequences feed a second major component: a Complex Invertible Key Matrix, or CIKM. The construction generalizes the classical Hill cipher, a linear encryption technique long considered too fragile for modern use, into the complex domain. A chaotic matrix whose entries are complex numbers generated independently by the two enhanced maps is embedded in a block structure alongside identity matrices, producing a larger key matrix that is its own inverse. This self-invertibility means the same matrix encrypts and decrypts, eliminating the computationally expensive inversion step entirely. Pixel-level scrambling is handled separately by Arnold’s Cat Map, whose control parameters are derived from the shared secret key, ensuring that both the permutation and the diffusion stages are keyed and image-dependent.

Authentication is woven into the design rather than bolted on. Before transmission, the sender computes a hash of the encrypted image, combines it with a hash derived from a curve point tied to the plaintext, and produces a digital signature using the sender’s private key. Crucially, the signature is verified before decryption begins, so any tampered or corrupted ciphertext is rejected without wasting computational resources on a meaningless reconstruction. The verification requires only a single complex point multiplication, which the authors note is more efficient than existing authenticated image encryption schemes. This pre-decryption check is particularly valuable in distributed or resource-constrained environments where bandwidth and processing cycles are at a premium.

The security evaluation is extensive. Encrypted versions of standard test images including Lena, Cameraman, Baboon, and Peppers at resolutions from 256 by 256 up to 1024 by 1024 showed uniformly flat histograms, with chi-square tests confirming statistical uniformity that outperformed a recent Sine-map-based competitor. Pixel correlation coefficients, which approach one in natural images, dropped to near zero in all horizontal, vertical, and diagonal directions. Information entropy of the ciphertexts approached the theoretical maximum of 8 bits per pixel for 8-bit grayscale images. Against differential attacks, the scheme achieved a Number of Pixels Change Rate of 99.62 percent and a Unified Average Changing Intensity of 33.46 percent, both matching or exceeding the ideal theoretical values. The total key space, computed from the secret key components, image hashes, private keys, chaotic map parameters, and scrambling controls, reaches an estimated 2 to the power of 896, far beyond the 2 to the 128 threshold generally considered safe against brute-force enumeration.

Perhaps the most surprising results concern computational efficiency, an area where complex arithmetic might be expected to hurt rather than help. Because multiplication of Gaussian integers splits into independent computations of real and imaginary parts, hardware multipliers handle inputs on the order of p rather than p squared, roughly halving the digit count per operand. Under schoolbook long multiplication, this reduces time complexity from order n squared to order n squared divided by 4, a fourfold speedup that persists even when two parallel multipliers compute the real and imaginary parts simultaneously. Elliptic curve operations are deliberately restricted to a constant number per session, independent of image size, so the dominant cost remains efficient pixel-level operations and complex matrix diffusion. The authors report low computational overhead suitable for near real-time secure image transmission at standard resolutions.

The scheme does make a deliberate trade-off. Because the complex self-invertible matrix applies a global transformation, any modification to the ciphertext, whether from noise injection, data loss, or deliberate cropping, propagates across the entire decrypted image. Peak signal-to-noise ratio measurements under Gaussian noise, salt-and-pepper noise, and occlusion attacks at 12.5, 25, and 50 percent data loss all showed severe degradation, rendering decrypted outputs unusable. The authors frame this not as a vulnerability but as a feature aligned with high-security requirements: the digital signature catches any corruption before decryption, and the extreme sensitivity guarantees that tampering cannot go undetected. Future work, they note, will extend the framework to video and hyperspectral imagery and explore adaptive key management strategies, but for now the Gaussian domain offers image encryption a broader, faster, and more defensible mathematical home.

Subject of Research: Gaussian elliptic curve cryptography and chaotic complex matrix methods for secure image encryption and authentication

Article Title: Secure image encryption and authentication using Gaussian elliptic curve and complex invertible matrix

Article References: Kamal, A., El-Kamchochi, H. A., El-Fahar, A., & Hagras, E. A. A. (2026). Secure image encryption and authentication using Gaussian elliptic curve and complex invertible matrix. Cluster Computing, 29(14), Article 798. https://doi.org/10.1007/s10586-026-06373-6

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06373-6

Keywords: image encryption, elliptic curve cryptography, Gaussian integers, chaotic maps, ElGamal key exchange, digital signature, Hill cipher, Arnold Cat Map, cryptography, information security, complex numbers, differential attacks