An efficient image encryption scheme based on ordered quasi-resonant Rossby/drift wave triads and Mordell elliptic curves

by   Ikram Ullah, et al.

We propose an image encryption scheme based on quasi-resonant Rossby/drift wave triads (related to elliptic surfaces) and Mordell elliptic curves (MECs). By defining a total order on quasi-resonant triads, at a first stage we construct quasi-resonant triads using auxiliary parameters of elliptic surfaces in order to generate pseudo-random numbers. At a second stage, we employ a MEC to construct a dynamic substitution box (S-box) for the plain-image. The generated pseudo-random numbers and S-box are used respectively to provide diffusion and confusion in the tested image. We test the proposed scheme against well-known attacks by encrypting all gray images taken from the USC-SIPI image database. Our experimental results indicate the high security of the newly developed scheme. Finally, via extensive comparisons we show that the new scheme outperforms other popular schemes.



There are no comments yet.


page 8

page 10

page 11


Efficient and Secure Substitution Box and Random Number Generators Over Mordell Elliptic Curves

Elliptic curve cryptography has received great attention in recent years...

Genus 2 Supersingular Isogeny Oblivious Transfer

We present an oblivious transfer scheme that extends the proposal made b...

Efficient Construction of S-boxes Based on a Mordell Elliptic Curve Over a Finite Field

Elliptic curve cryptography (ECC) is used in many security systems due t...

A Novel Image Encryption Scheme Based on Different Block Sizes for Grayscale and Color Images

In this paper, two image encryption schemes are proposed for grayscale a...

An Authenticated Key Scheme over Elliptic Curves and Security Considerations

Nodes of sensor networks may be resource-constrained devices, often havi...

An Authenticated Key Scheme over Elliptic Curves for Topological Networks

Nodes of sensor networks may be resource-constrained devices, often havi...

On the role of the Fibonacci matrix as key in modified ECC

In this paper, we have proposed a modified cryptographic scheme based on...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

The exchange of confidential images via internet is usual in today’s life, even though the internet is an open source that is unsafe and unauthorised persons can steal useful or sensitive information. Therefore it is essential to be able to share images in a secure way. This goal is achieved by cryptography. Traditional cryptographic techniques such as data encryption standard (DES) and advanced encryption standard (AES) are not suitable for image transmission because image pixels are usually highly correlated 

Mahmud (2020); Zhang (2014). In contrast, DES and AES are ideal techniques for text encryption El-Latif (2013), so researchers are trying to develop such techniques to meet the demand for reliable image delivery.

A number of image encryption schemes have been developed using different approaches Yang (2015); Zhong (2019); Li (2017); Hua (2018); Xie (2017); Alzaidi (2018); Azam (2017); Luo (2018); Li (2015). One of the dominant trends in encryption techniques is the chaos based encryption Ismaila (2020); Tang (2019); Abdelfatah (2019); Yu (2020); Zhu (2018); ElKamchouchi (2020). The reason is that the chaos based encryption schemes are highly sensitive to the initial parameters. The chaos based algorithms normally use pseudo-random numbers and substitution boxes (S-boxes) to create confusion and diffusion Cheng (2015); Belazi (2016). “Confusion” means to hide the relation between input image, secret keys and the corresponding cipher-image, and “diffusion” means to alter the value of each pixel in an input image Mahmud (2020). Cheng et al. Cheng (2015) proposed an image encryption algorithm based on pseudo-random numbers and AES S-box. The pseudo-random numbers are generated using AES S-box and chaotic tent maps. The scheme is optimised by combining the permutation and diffusion phases, but the image is encrypted in rounds which is time consuming. Belazi et al. Belazi (2016) suggested an image encryption algorithm using a new chaotic map and logistic map. The new chaotic map is used to generate a sequence of pseudo-random numbers for a masking phase. Then eight dynamic S-boxes are generated. The masked image is substituted in blocks via aforementioned S-boxes. The substituted image is again masked by another pseudo-random sequence generated by the logistic map. Finally the encrypted image is obtained by permuting the masked image. The permutation is done by a sequence generated by the map function. This algorithm fulfils the security analysis but performs slowly due to the four cryptographic phases. In Rehman (2016) an image encryption method based on chaotic maps and dynamic S-boxes is proposed. The chaotic maps are used to generate the pseudo-random sequences and S-boxes. To break the correlation, pixels of an input image are permuted by the pseudo-random sequences. In a second phase the permuted image is decomposed into blocks. Then blocks are encrypted by the generated S-boxes to get the cipher-image. From histogram analysis it follows that the suggested technique generates cipher-images with a nonuniform distribution.

Similar to the chaotic maps, Elliptic Curves (ECs) are sensitive to input parameters, but EC based cryptosystems are more secure than those of chaos Jia (2016). Toughi et al. Toughi (2017) developed a hybrid encryption algorithm using elliptic curve cryptography (ECC) and AES. The points of an EC are used to generate pseudo-random numbers and keys for encryption are acquired by applying AES to the pseudo-random numbers. The proposed algorithm gets the promising security but pseudo-random numbers are generated via the group law, which is time consuming. In El-Latif (2013) a cyclic EC and a chaotic map are combined to design an encryption algorithm. The developed scheme overcomes the drawbacks of small key space but is unsafe to the known-plaintext/chosen-plaintext attack Liu (2014). Similarly Hayat et al. Hayat (2019) proposed an EC based encryption technique. The stated scheme generates pseudo-random numbers and dynamic S-boxes in two phases, where the construction of S-box is not guaranteed for each input EC. Therefore, changing of ECs to generate an S-box is a time-consuming work. Furthermore, the generation of ECs for each input image makes it insufficient.

Based on the above discussion, we propose an improved image encryption algorithm, based on quasi-resonant Rossby/drift wave triads Bustamante (2013); Hayat (2016) (triads, for short) and Mordell Elliptic Curves (MECs). The triads are utilised in the generation of pseudo-random numbers and MECs are employed to create dynamic S-boxes using the technique introduced in Azam1 (2019). The proposed scheme is novel in that it introduces the technique of pseudo-random numbers generation using triads, which is faster than generating pseudo-random numbers by ECs. Moreover, the scheme does not require to separately generate triads for each input image of the same size. In the present scheme MECs are used opposite to Hayat (2019) in the sense that now, for each input image, the generation of a dynamic S-box is guaranteed Azam (2018). Finally, extensive performance analyses and comparisons reveal the efficiency of the proposed scheme.

This paper is organised as follows. Preliminaries are described in Section 2. In Section 3, the proposed encryption algorithm is explained in detail. Section 4 provides the experimental results of the newly developed scheme. A comparison is drawn in Section 5 between the proposed method and existing popular schemes. Lastly, conclusions are presented in Section 6.

2 Preliminaries

Barotropic vorticity equation: The barotropic vorticity equation (in the so-called

-plane approximation) is a partial differential equation of the form


where represents the stream function, is a real constant and is a non-negative real constant. We assume periodic boundary conditions: for all . In literature Eq. (1) is also known as the Charney-Hasegawa-Mima equation (CHM) Charney (1948); Hasegawa (1978); Connaughton (2010); Harris (2013); Galperin (2019). This equation accepts many special solutions, including travelling wave solutions. Of central importance is the so-called Rossby wave, which is a solution of both the linearised form and the whole (nonlinear) form of Eq. (1). This solution is given explicitly by the parameterised function , where is called the angular frequency and

is called the wave vector. For simplicity we take

and in what follows Bustamante (2013); Hayat (2016).
Resonant triad, quasi-resonant triad and detuning level: A linear combination of Rossby waves parameterised by wave vectors that are not collinear, is again a solution of the linearised form of Eq. (1), but not a solution of the whole equation. However, to the lowest order of nonlinearity in Eq. (1), approximate solutions known as resonant triad solutions can be constructed via linear combinations. Any set of three wave vectors and satisfying the equations:


for is called a resonant triad. If the equation is replaced by the inequality , for a large positive number , then the triad becomes a quasi-resonant triad and is known as the detuning level of the quasi-resonant triad. For simplicity, in what follows we call a quasi-resonant triad simply a triad and denote it by . Finally, to avoid over-counting of triads we will impose the condition .
Rational transformation: In Bustamante (2013) wave vectors are explicitly expressed in terms of rational variables and as follows:


In the case the rational variables lie on an elliptic surface. The transformation is bijective and its inverse mapping is given by:


New parameterisation: In Kopp (2017), Kopp parameterised the resonant triads and in terms of parameters and it follows by (Kopp, 2017, Eq. (1.22)) that:


In , Hayat et al. Hayat (2016) found a new parameterisation of and in terms of auxiliary parameters and hence and are given by:


Elliptic curve: Let be a finite field for any prime , then an EC over is defined by


where . The integers and are called parameters of an EC. The number of all satisfying the congruence (11) is denoted by . For , the type of ECs is known as Mordell elliptic curve (MEC). If points on are ordered according to some total order then is said to be an ordered EC. Recall that total order is a binary relation which possesses the reflexive, antisymmetric and transitive properties. Azam et al. Azam1 (2019) introduced a total order known as a natural ordering on MECs given by

and generated efficient S-boxes using the aforesaid ordering. We will use natural ordering to generate S-boxes. Thus from here on stands for a naturally ordered MEC unless it is specified otherwise.

3 The Proposed encryption scheme

The proposed encryption scheme is based on pseudo-random numbers and S-boxes. The pseudo-random numbers are generated using quasi-resonant triads. To get an appropriate level of diffusion we need to properly order the s. For this purpose we define a binary relation as follows.

3.1 Ordering on quasi-resonant triads

Let represent the triads respectively, then

where and are the corresponding auxilary parameters of and respectively.

Lemma .

If denotes the set of s in a box of size , then is a total order on .


The reflexivity of follows from and and hence As for antisymmetry we suppose and . Then, by definition and , which imply . So we are left with two results: and , which imply . Thus, we obtain the results and , which ultimately give . Solving Eqs. (8)–(10) for the obtained values we get and from Eq. (2) it follows that . Consequently and is antisymmetric. As for transitivity, let us assume and . Then and , implying . If then transitivity follows. If , then too. Thus, and , so . If then transitivity follows. If , then too. Thus, and , implying and hence transitivity follows: . ∎

Let stand for the set of s ordered with respect to the order . The main steps of the proposed scheme are explained as follows.

3.2 Encryption

A. Public parameters: In order to exchange the useful information the sender and receiver should agree on the public parameters described as below:

  1. Three sets: Choose three sets of consecutive numbers with unknown step sizes, where the end points are rational numbers.

  2. A total order: Select a total order so that the triads generated by the above mentioned sets may be arranged with respect to that order.

Suppose that represents an image of size to be encrypted, and the pixels of are arranged in column wise linear ordering. Thus, for positive integer , represents the -th pixel value in linear ordering. Assume that is the sum of all pixel values of image . Then the proposed scheme chooses the secret keys in the following ways.

B. Secret keys: To generate confusion and diffusion in an image, the sender chooses the secret keys as follows.

  1. Step size: Select positive integers to construct the step sizes of . Also choose a non-negative integer as a step size of in such a way that , where represents the number of elements in .

  2. Detuning level: Fix some posive integer to find the detuning level allowed for the triads.

  3. Bound: Select a positive integer such that for This condition is imposed in order to bound the components of the triad wave vectors. Furthermore, choose an integer to find , where gives the nearest integer when is divided by . The reason for choosing such a is to generate key dependent S-boxes and the integer is used to diffuse the components of triads.

  4. A prime: Select a prime such that as a secret key for computing to generate an S-box on the .

The positive integers and are secret keys. Here it is mentioned that the parameters and are used to generate triads in a box of size . The generation of triads is explained step by step in Algorithm 1. These triads along with keys and are used to generate the sequence of pseudo-random numbers.

/* T is a set containing the Quasi-resonant triads, while and are the dimensions of an input image. */
Input : Three sets , inverse detuning level , bound , two positive integers and .
Output : Quasi-resonant triads
1 ; ; for  do
2       for  do
3             ;
4             Calculate and store the values of , and for each pair using Eqs. (8)-(10).
5       end for
7 end for
8for  do
9       for  do
10             and ;
11             and
13             if  and  then
14                   ;
16             end if
17            if #T=mn then
18                  break;
19             end if
21       end for
22      break;
23 end for
Sort with respect to the ordering to get .
Algorithm 1 Generating Quasi-resonant triads

Thus represents the -th triad in ordered set . Moreover, are the components of . In Algorithm 2, the generation of is explained.

1.50 Input : An ordered set , an integer and a plain-image .
Output : Random numbers sequence .
; ;
Algorithm 2 Generating the proposed pseudo-random sequence

The proposed sequence is cryptographically a good source of pseudo-randomness because triads are highly sensitive to the auxiliary parameters  Hayat (2016) and inverse detuning level . It is shown in Bustamante (2013) that the intricate structure of clusters formed by triads depends on the chosen , and the size of the clusters increases as the inverse detuning level increases. Moreover, the generation of triads is rapid due to the absence of modular operation.

C. Performing diffusion. To change the statistical properties of an input image diffusion process is performed. While performing the diffusion, the pixel values are changed using the sequence . Let denote the diffused image for a plain-image . The proposed scheme alters the pixels of according to the Eq. (12):


D. Performing confusion. Nonlinear function causes confusion in a cryptosystem, and nonlinear components are necessary for a secure data encryption scheme. The current scheme uses the dynamic S-boxes to produce the confusion in an encrypted image. If stands for the encrypted image of , then confusion is performed by the Eq. (13) as follows:

Lemma .

If and is a prime chosen for the generation of an S-box, then the time complexity of the proposed encryption scheme is max.


The computation of all possible values of and in Algorithm (1) takes time. Similarly the time complexity for generating is but executes times. Thus the time required by and hence by is . Also Algorithm 1 in Azam1 (2019) shows that the proposed S-box can be constructed in time. Thus the time complexity of the proposed scheme is max. ∎

3.3 Decryption

In our scheme the decryption process can take place by reversing the operations of the encryption process. One should know the inverse S-box and the pseudo-random numbers . Assume the situation when the secret keys , and are transmitted by a secure channel, so that the set is obtained using keys and , and hence the S-box and the pseudo-random numbers can be computed by and . Finally, the receiver gets the original image by applying the following equations:


4 Security analysis

In this section the security of the proposed scheme is analysed. For this purpose the current scheme is implemented on all gray images of USC-SIPI Image Database Dbase . The USC-SIPI database contains images of size , Furthermore, some security analyses which are explained one by one in the associated subsections are presented. To validate the quality of the proposed scheme, the experimental results are compared with some other encryption schemes. The parameters used for the experiments are for resp., and varies for each . The experiments are performed using Matlab Ra on a personal computer with GHz Processor and GB RAM. All encrypted images of the database along with histograms are available at Some plain-images House, Stream, Boat and Male and their cipher-images are displayed in Fig. 1.

Figure 1: (a)-(d) Plain-images House, Stream, Boat and Male; (e)-(h) cipher-images of the plain-images (a)-(d), respectively.

4.1 Statistical attack

A cryptosystem is said to be secure if it has high resistance against statistical attacks. The strength of resistance against statistical attacks is measured by entropy, correlation and histogram tests. All these tests are applied to evaluate the performance of the discussed scheme.

  1. Histogram. Histogram is a graphical way to display the frequency distribution of pixel values of an image. A secure cryptosystem generates cipher-images with uniform histograms. The histograms of the encrypted images using the proposed method are available at However, the respective histograms for images in Fig. 1 are shown in Fig. 2. The histograms of the encrypted images are almost uniform. Moreover, the histogram of an encrypted image is totally different from that of the respective plain-image, so that it does not allow useful information to the adversaries, and the proposed algorithm can resist any statistical attack.

    Figure 2: (a)-(d) Histograms of Fig. 1(a)-(d); (e)-(h) Histograms of Fig. 1(e)-(h).
  2. Entropy. Entropy is a standout feature to measure the disorder. Let be a source of information over a set of symbols , then entropy of is calculated by:



    is the probability of occurrence of symbol

    The ideal value of is , if all symbols of occur in with the same probability. Thus, an image emanating gray levels is absolutely pseudo-random if The entropy results for all images encrypted by the suggested technique are shown in Fig. 3, where the minimum, average and maximum values are and respectively. These results are close to , and hence the developed mechanism is secure against entropy attacks.

  3. Pixel correlation. A meaningful image has strong correlation among the adjacent pixels. In fact, a good cryptosystem has the ability to break the pixel correlation and bring it close to zero. For any two gray values and , the pixel correlation can be computed as:


    where and

    denote expectation and variance of

    respectively. The range of is to . The gray values and are in low correlation if is close to zero. As the pixels may be adjacent in horizontal, diagonal and vertical directions, the correlation coefficients of all encrypted images along all the three directions are shown in Fig. 3, where the respective ranges of are [, ], [,] and [,]. These results show that the presented method is capable of reducing the pixel correlation near to zero.

    Figure 3: (a)-(c) The horizontal, diagonal and vertical correlations among pixels of each image in USC-SIPI database; (d) The entropy of each image in USC-SIPI database.

    In addtion, pairs of adjacent pixels of the plain-image and cipher-image of Lena are pseudo-randomly selected. Then correlation distributions of the adjacent pixels in all the three directions are shown in Fig. 4, which reveals the strong pixel correlation in the plain-image but weak pixel correlation in the cipher-image generated by the current scheme.

    Figure 4: (b)-(d) The distribution of pixels of plane-image in horizontal, diagonal and vertical directions; (f)-(h) The distribution of pixels of cipher-image in horizontal, diagonal and vertical directions.

4.2 Differential attack

In differential attacks the opponents try to get the secret keys by studying the relation between the plain-image and cipher-image. Normally attackers encrypt two images by applying a small change to these images, then compare the properties of the corresponding cipher-images. If a minor change in original image can cause the significant change in encrypted image, then the cryptosystem has high security level. The two tests NPCR (number of pixels change rate) and UACI (unified average changing intensity) are usually used to describe the security level against differential attacks. For two plain-images and different at only one pixel value, let and are the cipher-images of and respectively, then NPCR and UACI are calculated as:


where if and otherwise. The ideal values of NPCR and UACI are and respectively. We applied the above two tests on each image of the database by pseudo-randomly changing the pixel value of each image. The experimental results are shown in Fig. 5, where the average values of NPCR and UACI are and respectively. It follows from the obtained results that our scheme is capable of resisting a differential attack.

Figure 5: (a-b) The NPCR and UACI results for each image in USC-SIPI database; (c) First pseudo-random numbers and (d) two S-boxes generated for Lena with a small change in an input key .

4.3 Key analysis

For a secure cryptosystem it is essential to perform well against key attacks. A cryptosystem is highly secure against key attacks if it has key sensitivity, large key space and strongly opposes the known-plaintext/chosen-plaintext attack. The proposed scheme is analysed against key attacks as follows.

  1. Key sensitivity. Attackers usually use slightly different keys to encrypt a plain-image and then compare the obtained cipher-image with the original cipher-image to get the actual keys. Thus, high key sensitivity is essential for higher security. That is, cipher-images of a plain-image generated by slightly two different keys should be entirely different. The difference of the cipher-images is quantified by Eqs. (18) and (19). In experiments we encrypted the whole database by changing only one key, while other keys are remain unchanged. The key sensitivity results are shown in Table 1, where the average values of NPCR and UACI are and respectively, which specify the remarkable difference in the cipher-images. Moreover, our cryptosytem is based on pseudo-random numbers and S-boxes. The sensitivity of pseudo-random numbers sequences and and S-boxes and for Lena is shown in Fig. 5.

    Image NPCR(%) UACI(%) Image NPCR(%) UACI(%) Image NPCR(%) UACI(%)
    Female 99.62 33.39 House 99.62 33.23 Couple 99.56 33.30
    Tree 99.59 33.35 Beans 99.64 33.23 Splash 99.60 33.97
    Table 1: Difference between two encrypted images when key is changed to .
  2. Key space. In order to resist a brute force attack, key space should be sufficiently large. For any cryptosystem key space represents the set of all possible keys required for encryption process. Generally, the size of key space should be greater than In present scheme the parameters and are used as secret keys, and we store each of them in bits. So the key space of the proposed cryptosystem is which is larger than and hence capable to resist the brute force attack.

  3. Known-plaintext/chosen-plaintext attack. In known-plaintext attack, the attacker has partial knowledge about the plain-image and cipher-image, and tries to break the cryptosystem, while in chosen-plaintext attack the attacker encrypts an arbitrary image to get the encryption keys. An all-white/black image is usually encrypted to test the performance of a scheme against these powerful attacks. We analysed our scheme by encrypting an all-white/black image of size . The results are shown in Fig. 6 and Table 2, revealing that the encrypted images are significantly pseudo-randomised. Thus the proposed system is capable of preventing the above mentioned attacks.

    Figure 6: (a) All-white; (b) All-black; (c-d) cipher-images of (a-b); histograms of (c-d).

    Plain-image Entropy Correlation of plain-image NPCR(%) UACI(%)
    Hori. Diag. Ver.
    All-white 7.9969 0.0027 0.0020 -0.0090 99.60 33.45
    All-black 7.9969 -0.0080 0.0035 0.0057 99.62 33.41
    Table 2: Security analysis of all-white/black encrypted images by the proposed encryption technique.

5 Comparison and discussion

Apart from security analyses, the proposed scheme is compared with some well known image encryption techniques. The gray scale images of Lena and Lena are encrypted using the presented method, and experimental results are listed in Table 3.

Size Algorithm Entropy         Correlation NPCR (%) UACI(%) Dynamic
Hori. Diag. Ver. S-boxes S-boxes
Ours 7.9974 0.0001 -0.0007 -0.0001 99.91 33.27 1 Yes
Ref. Hayat (2019) 7.9993 0.0012 0.0003 0.0010 99.60 33.50 1 Yes
Ref. El-Latif (2013) 7.9973 - - - 99.50 33.30 0 -
Ref. Rehman (2016) 7.9046 0.0164 -0.0098 0.0324 98.92 32.79 >1<50 Yes
Ref. Belazi (2016) 7.9963 -0.0048 -0.0045 -0.0112 99.62 33.70 8 Yes
Ref. Wu (2017) 7.9912 -0.0001 0.0091 0.0089 100 33.47 0 -
Ref. Wan (2020) 7.9974 0.0020 0.0020 0.0105 99.59 33.52 0 -
Ours 7.9993 0.0001 0.0042 0.0021 99.61 33.36 1 Yes
Ref. Cheng (2015) 7.9992 0.0075 0.0016 0.0057 99.61 33.38 1 No
Ref. Toughi (2017) 7.9993 -0.0004 -0.0018 0.0001 99.60 33.48 1 No
- Ref. Tong (2016) 7.9970 -0.0029 0.0135 0.0126 99.60 33.48 0 -
Ref. Zhang (2014) 7.9994 0.0018 -0.0012 0.0011 99.62 33.44 >1 Yes
Ref. Zhang (2014) 7.9993 0.0032 0.0011 -0.0002 99.60 33.47 >1 Yes
Table 3: Comparison of the proposed encryption scheme with several existing cryptosystems for image Lena, .

It is deduced that our scheme generates cipher-images with comparable security. Furthermore, we remark that the scheme in Toughi (2017) generates pseudo-random numbers using group law on EC, while the proposed method generates pseudo-random numbers by constructing triads using auxiliary parameters of elliptic surfaces. Group law consists of many operations, which makes the pseudo-random number generation process slower than the one we present here. Moreover, the S-box used in Toughi (2017) is a static one which is vulnerable Rosenthal (2003), while our scheme generates a dynamic S-box for each image which is more secure Kazlauskas (2009). The scheme in Belazi (2016) decomposes an image to eight blocks and uses eight dynamic S-boxes for encryption purpose. The computation of multiple S-boxes takes more time than computing only one S-box. Similarly the techniques in Zhang (2014); Rehman (2016) use a set of S-boxes and encrypt an image in blocks, while our newly developed scheme encrypts the whole image using only one dynamic S-box. Thus, our scheme is faster than the schemes in Zhang (2014); Rehman (2016). The security system in Tong (2016) uses a chaotic system to encrypt blocks of an image. The results in Table 3 reveal that our proposed system is cryptographically stronger than the scheme in Tong (2016). The algorithms in Wu (2017); El-Latif (2013) combine chaotic systems and different ECs to encrypt images. It follows from Table 3 that the security level of our scheme is comparable to that of the schemes in Wu (2017); El-Latif (2013). The technique in Wan (2020) uses double chaos along with DNA coding to get good results as shown in Table 3, but the results obtained by the new scheme are better than that of Wan (2020). Similarly the technique in Hayat (2019) encrypts images using ECs, the disadvantage of that scheme is that it does not generate an S-box for each input image and the generation of an S-box needs trials, while our scheme generates a dynamic S-box for each input image, thus making our scheme faster and more robust than the scheme developed in Hayat (2019).

6 Conclusion

An image encryption scheme based on quasi-resonant triads and MECs is introduced. The proposed technique constructs triads to generate pseudo-random numbers and computes a MEC to construct an S-box for each input image. The pseudo-random numbers and S-box are then used for altering and scrambling the pixels of the plain-image respectively. As for the advantages of our proposed method, firstly triads are based on auxiliary parameters of elliptic surfaces, and thus pseudo-random numbers and S-boxes generated by our method are highly sensitive to the plain-image, which prevents adversaries from initiating any successful attack. Secondly, generation of triads using auxiliary parameters of elliptic surfaces consumes less time than computing points on ECs (we find a 4x speed increase for a range of image resolutions ), which makes the new encryption system relatively faster. Thirdly, our algorithm generates the cipher-images with an appropriate security level.

In summary, all of the above analyses imply that the presented scheme is able to resist all attacks. It has high encryption efficiency and less time complexity than some of the existing techniques. In the future, the current scheme will be further optimised by means of new ideas to construct the S-boxes using the constructed triads, so that for each input image we will not need to compute a MEC.

All authors contributed equally to this work.

This research is funded through HEC project NRPU-7433.

We thank Gene Kopp for useful comments and suggestions. The authors declare no conflict of interest. The funding sponsors had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, and in the decision to publish the results. The following abbreviations are used in this manuscript:
MEC Mordell elliptic curve
S-box Substitution box
EC Elliptic curves
no References


  • Mahmud (2020) Mahmud, M., Lee, M., and Choi, J. Y. Evolutionary-Based Image Encryption using RNA Codons Truth Table. Optics and Laser Technology 2020, 121, 105818 (1-8).
  • Zhang (2014) Zhang, X., Mao, Y., and Zhao, Z. An Efficient Chaotic Image Encryption Based on Alternate Circular S-boxes. Nonlinear Dynamics 2014, 78(1), 359-369.
  • El-Latif (2013) El-Latif, A. A. A., and Niu, X. A Hybrid Chaotic System and Cyclic Elliptic Curve for Image Encryption. AEU-International Journal of Electronics and Communications 2013, 67(2), 136-143.
  • Yang (2015) Yang, Y. G., Pan, Q. X., Sun, S. J., and Xu, P. Novel Image Encryption Based on Quantum Walks. Scientific Reports 2015, 5(1), 1-9.
  • Zhong (2019)

    Zhong, H., Chen, X., and Tian, Q. An Improved Reversible Image Transformation Using K-Means Clustering and Block Patching.

    Information 2019, 10(1), 1-17.
  • Li (2017) Li, C., Lin, D., and Lü, J. Cryptanalyzing an Image-Scrambling Encryption Algorithm of Pixel Bits. IEEE MultiMedia 2017, 24(3), 64-71.
  • Hua (2018) Hua, Z., Yi, S., and Zhou, Y. Medical Image Encryption using High-Speed Scrambling and Pixel Adaptive Diffusion. Signal Processing 2018, 144, 134-144.
  • Xie (2017) Xie, E. Y., Li, C., Yu, S., and Lü, J. On the Cryptanalysis of Fridrich’s Chaotic Image Encryption Scheme. Signal processing 2017, 132, 150-154.
  • Alzaidi (2018) Alzaidi, A. A., Ahmad, M., Ahmed, H. S., and Solami, E. A. Sine-Cosine Optimization-Based Bijective Substitution-Boxes Construction using Enhanced Dynamics of Chaotic Map. Complexity 2018, 1-16.
  • Azam (2017) Azam, N. A. A Novel Fuzzy Encryption Technique Based on Multiple Right Translated AES Gray S-Boxes and Phase Embedding. Security and Communication Networks 2017, 1-10.
  • Luo (2018) Luo, Y., Tang, S., Qin, X., Cao, L., Jiang, F., and Liu, J. A Double-Image Encryption Scheme Based on Amplitude-Phase Encoding and Discrete Complex Random Transformation. IEEE Access 2018, 6, 77740-77753.
  • Li (2015) Li, J., Li, J. S., Pan, Y. Y., and Li, R. Compressive Optical Image Encryption. Scientific Reports 2015, 5, 1-10.
  • Ismaila (2020) Ismail, S. M., Said, L. A., Radwan, A. G., Madian, A. H., and Abu-ElYazeed, M. F. A Novel Image Encryption System Merging Fractional-Order Edge Detection and Generalized Chaotic Maps. Signal Processing 2020, 167, 107280 (1-21).
  • Tang (2019) Tang, Z., Yang, Y., Xu, S., Yu, C., and Zhang, X. Image Encryption with Double Spiral Scans and Chaotic Maps. Security and Communication Networks 2019, 1-16.
  • Abdelfatah (2019) Abdelfatah, R. I. Secure Image Transmission Using Chaotic-Enhanced Elliptic Curve Cryptography. IEEE Access 2019, 1-16.
  • Yu (2020) Yu, J., Guo, S., Song, X., Xie, Y., and Wang, E. Image Parallel Encryption Technology Based on Sequence Generator and Chaotic Measurement Matrix. Entropy 2020, 22(1), 1-16.
  • Zhu (2018) Zhu, S., Zhu, C., and Wang, W. A Novel Image Compression-Encryption Scheme Based on Chaos and Compression Sensing. IEEE Access 2018, 6, 67095-67107.
  • ElKamchouchi (2020) ElKamchouchi, D. H., Mohamed, H. G., and Moussa, K. H. A Bijective Image Encryption System Based on Hybrid Chaotic Map Diffusion and DNA Confusion. Entropy 2020, 22(2), 1-18.
  • Cheng (2015) Cheng, P., Yang, H., Wei, P., and Zhang, W. A Fast Image Encryption Algorithm Based on Chaotic Map and Lookup Table. Nonlinear Dynamics 2015, 79(3), 2121-2131.
  • Belazi (2016) Belazi, A., El-Latif, A. A. A., and Belghith, S. A Novel Image Encryption Scheme Based on Substitution-Permutation Network and Chaos. Signal Processing 2016, 128, 155-170.
  • Rehman (2016) Rehman, A. U., Khan, J. S., Ahmad, J., and Hwang, S. O. A New Image Encryption Scheme Based on Dynamic S-boxes and Chaotic Maps. 3D Research 2016, 7(1), 1-8.
  • Jia (2016) Jia, N., Liu, S., Ding, Q., Wu, S., and Pan, X. A New Method of Encryption Algorithm Based on Chaos and ECC. Journal of Information Hiding and Multimedia Signal Processing 2016, 7(3), 637-643.
  • Toughi (2017) Toughi, S., Fathi, M. H., and Sekhavat, Y. A. An Image Encryption Scheme Based on Elliptic Curve Pseudo Random and Advanced Encryption System. Signal processing 2017, 141, 217-227.
  • Liu (2014) Liu, H., and Liu, Y. (2014). Cryptanalyzing an Image Encryption Scheme Based on Hybrid Chaotic System and Cyclic Elliptic Curve. Optics & Laser Technology 2014, 56, 15-19.
  • Hayat (2019) Hayat, U., and Azam, N. A. A Novel Image Encryption Scheme Based on an Elliptic Curve. Signal Processing 2019, 155, 391-402.
  • Bustamante (2013) Bustamante, M. D., and Hayat, U. Complete Classification of Discrete Resonant Rossby/Drift Wave Triads on Periodic Domains. Communications in Nonlinear Science and Numerical Simulation 2013, 18(9), 2402-2419.
  • Hayat (2016) Hayat, U., Amanullah, S., Walsh, S., Abdullah, M., and Bustamante, M. D. Discrete Resonant Rossby/Drift Wave Triads: Explicit Parameterisations and a Fast Direct Numerical Search Algorithm. Communications in Nonlinear Science and Numerical Simulation 2019, 79, 104896 (1-19).
  • Azam1 (2019) Azam, N. A., Hayat, U., and Ullah, I. Efficient Construction of S-boxes Based on a Mordell Elliptic Curve Over a Finite Field. Frontiers of Information Technology and Electronic Engineering 2019, 20(10), 1378-1389.
  • Azam (2018) Azam, N. A., Hayat, U., and Ullah, I. An Injective S-Box Design Scheme over an Ordered Isomorphic Elliptic Curve and Its Characterization. Security and Communication Networks 2018, 1-9.
  • Charney (1948) Charney, J. G. On the scale of atmospheric motions. Geophys. Public 1948, 17, 3–17.
  • Hasegawa (1978) Hasegawa, A. and Mima, K. Pseudo-three-dimensional turbulence in magnetized nonuniform plasma. The Physics of Fluids 1978, 21(1), 87–92.
  • Connaughton (2010) Connaughton, C.P., Nadiga, B.T., Nazarenko, S.V., and Quinn, B.E. Modulational instability of Rossby and drift waves and generation of zonal jets. Journal of Fluid Mechanics 2010, 654, 207–231.
  • Harris (2013) Harris, J., Connaughton, C., and Bustamante, M.D. Percolation transition in the kinematics of nonlinear resonance broadening in Charney–Hasegawa–Mima model of Rossby wave turbulence. New Journal of Physics 2013, 15(8), 083011.
  • Galperin (2019) Galperin, B. and Read, P. L., editors. Zonal Jets: Phenomenology, Genesis, and Physics. Cambridge University Press 2019.
  • Kopp (2017) Kopp, G. S. The Arithmetic Geometry of Resonant Rossby Wave Triads. SIAM Journal on Applied Algebra and Geometry 2017, 1(1), 352-373.
  • (36) USC-SIPI Image Database available at
  • Wu (2017) Wu, J., Liao, X., and Yang, B. Color Image Encryption Based on Chaotic Systems and Elliptic Curve ElGamal Scheme. Signal Processing 2017, 141, 109-124.
  • Wan (2020) Wan, Y., Gu, S., and Du, B. A New Image Encryption Algorithm Based on Composite Chaos and Hyperchaos Combined with DNA Coding. Entropy 2020, 22(2), 1-19.
  • Tong (2016) Tong, X. J., Zhang, M., Wang, Z., and Ma, J. A Joint Color Image Encryption and Compression Scheme Based on Hyper-Chaotic System. Nonlinear Dynamics 2016, 84(4), 2333-2356.
  • Zhang (2014) Zhang, Y., and Xiao, D. An Image Encryption Scheme Based on Rotation Matrix Bit-Level Permutation and Block Diffusion. Communications in Nonlinear Science and Numerical Simulation 2014, 19(1), 74-82.
  • Rosenthal (2003) Rosenthal, J. A Polynomial Description of the Rijndael Advanced Encryption Standard. Journal of Algebra and its Applications 2003, 2(2), 223-236.
  • Kazlauskas (2009) Kazlauskas K, Kazlauskas J. Key-Dependent S-box Generation in AES Block Cipher system. Informatica 2009, 20(1), 23-34.