Construction of New S-Box Using Action of Quotient of the Modular Group for Multimedia Security

Shahzad, Imran; Mushtaq, Qaiser; Razaq, Abdul

doi:https://doi.org/10.1155/2019/2847801

Security and Communication Networks

On this page

Abstract Introduction Preliminaries Results and Discussion Conclusions Data Availability Disclosure Conflicts of Interest Authors’ Contributions References Copyright Related Articles

Research Article | Open Access

Volume 2019 | Article ID 2847801 | https://doi.org/10.1155/2019/2847801

Construction of New S-Box Using Action of Quotient of the Modular Group for Multimedia Security

Imran Shahzad,¹Qaiser Mushtaq,²and Abdul Razaq³

Academic Editor: Emanuele Maiorana

Received22 May 2019

Revised11 Oct 2019

Accepted22 Oct 2019

Published30 Nov 2019

Abstract

Substitution box (S-box) is a vital nonlinear component for the security of cryptographic schemes. In this paper, a new technique which involves coset diagrams for the action of a quotient of the modular group on the projective line over the finite field is proposed for construction of an S-box. It is constructed by selecting vertices of the coset diagram in a special manner. A useful transformation involving Fibonacci sequence is also used in selecting the vertices of the coset diagram. Finally, all the analyses to examine the security strength are performed. The outcomes of the analyses are encouraging and show that the generated S-box is highly secure.

1. Introduction

With rapid advancement in communication technology, the maintenance of data security has become a great challenge for cryptographers. A number of useful encryption algorithms and techniques are created in interesting papers by Belazi et al. [1, 2] to ensure the safety of transmitted information. In this regard, block encryption algorithm plays an important role in modern cryptographic systems. The important component of block encryption algorithm is the substitution box (S-box). The S-box has been used in many cryptosystems including Data Encryption Standard (DES), International Data Encryption Algorithm (IDEA), and Advanced Encryption Standard (AES). The security strength of the S-box determines the security strength of the entire cryptosystem. It is therefore established that the S-box is an important nonlinear component for the security of cryptographic schemes.

The DES was proposed by a well-known computer production company in 1977, and the DES investigations drove the refinement in the cryptographic system enormously [3]. Later, a group of university students broke the DES security. This led to the realization that of some other secure and efficient encryption method has to be evolved. In 2002, the Advanced Encryption Standard (AES) was created by Daemen and Rijmen, which is now the standard for the encryption [4]. The S-box has a vital role in quality of encryption. Utilization of a weak S-box is tantamount to compromising on the security of encryption process. Therefore, before using an S-box in a cryptosystem, it is pertinent to assess its strength. The analyses for measuring strength include nonlinearity method (NL), linear approximation probability method (LAP), bit independence criterion (BIC), strict avalanche criterion (SAC), and differential approximation probability method (DAP). Some studies related to the construction of S-box and its strength are in [5, 6]. The analyses of the S-box in image encryption based on majority logic criteria are investigated in [7, 8]. More investigation on the S-box based on a chaotic map is conducted in [9], hyperchaotic system-based S-box in [10], and chaotic neural network-based S-box in [11]. An efficient S-box is constructed in [12] by using a 2D Logistic-adjusted-Sine map, linear fractional transformation, and Gray code. Chen et al. described an S-box based on three-dimensional chaotic baker maps in [13]. Hayat and Azam [14] used elliptic curves to construct an S-box by considering the ordinate of the curve for this construction. The construction of an S-box by using the projective general linear group was investigated by Altaleb et al. in [15]. Thus, various aspects of construction of an S-box are investigated to get a secure and better S-box which enables better encryption.

The techniques and methods for the generation of S-boxes presented in the literature are either suitable for the creation of static S-boxes or are very complicated and time consuming. Static S-boxes have their own limitations and weaknesses. These S-boxes may help attackers in the cryptanalysis of the captured ciphertext, and hence they may reach the original plaintext. On the other hand, the methods presented in the literature that generate dynamic and key-dependent S-boxes are entirely complex and inefficient. For example, recently, attackers have been successful in breaking the loops of AES. Thus, the need for an efficient method to generate dynamic S-boxes exists. The construction of an S-box using the first time group graphs is presented as an alternative S-box design technique. It exponentially improved security and efficacy which is vividly visible in subsequent work in this paper.

We propose an efficient technique for the construction of an S-box by using action of a quotient of on . The permutations obtained in this way are used to draw a coset diagram. The vertices of the coset diagram are considered in a special way for constructing an S-box. The S-box generated in this way is highly secure, closely meeting the optimal values of the standard S-box. All the tests for the security strength are performed and compared with other S-boxes confirming that the proposed S-box is highly secure.

2. Preliminaries

The modular group is the free product of two cyclic groups of orders 2 and 3. Its finite presentation is [16]. It is the most studied group, and in the documentation for the award of Abel Prize in 2009, it is described as “one of the most important groups in the modern history of mathematics.” Here, and are generators of the modular group. These generators are linear fractional transformations defined as and . By adjoining a new element with and , one obtains a presentation of the extended modular group . Its existence is described in Lemma 2. Let be a power of a prime . Then, by the projective line over the finite field , denoted by , we mean .

Higman introduced a graph for the modular group . It is well known now as a coset diagram for the modular group. The three cycles of are represented by triangles whose vertices are permuted anticlockwise by , and any two vertices which are interchanged by are connected by an edge. The fixed points of and , if they exist, are denoted by heavy dots. For more details about coset diagrams, we suggest reading [17–19].

Consider the action of the modular group on . We apply and on each element of to find permutation representation of and (see Table 1). Note that, if we apply or on any element of , normally a fraction is obtained. Since in , , we continue to add in the numerator so that an integral value is acquired.

In this way, we obtain the permutation representation of and as follows:

Each cycle of length 3 is represented as a triangle, and each cycle of length 2 by an edge connecting vertices of the triangles, producing the following coset diagram. Here, 5, 8 are the fixed points of and 4, 10 are the fixed points of . The coset diagram evolved from the above permutations is shown in Figure 1.

A group is called the triangle group if it can be presented as where are the positive integers. It is denoted by . The triangle groups are particularly important as being one-relator quotients of . The triangle groups is finite if . The symmetric groups and alternating groups are finite triangle groups of the form .

The purpose of this study is to establish a scheme for S-box construction by taking action of = on . In this construction, we also utilize the Fibonacci sequence as it is one of the most interesting, useful, and close to the real life. A flow chart of the proposed scheme is presented in Figure 2.

3. Parametrization

There are several methods adopted by researchers for the construction of an S-box. Some cryptographers, while constructing an algebraic S-box, considered the action of a group on sets, real, or quadratic lines. But the use of coset diagrams is new in the literature. In the proposed scheme, we take action of on , then in the second step, we draw a coset diagram of the action, and finally we construct an S-box by using vertices of the coset diagram. The action of the modular group on evolves a coset diagram in which each vertex is fixed by . In Figure 1, one can see that each vertex of the coset diagram is fixed by . This coset diagram represents the homomorphic image of the group . In order to draw a coset diagram for , where is of our own choice, there is a method given in [20], known as parametrization method. It is expressed in the following way.

Lemma 1. There are just two conjugacy classes of nondegenerate homomorphism from to in which is of order 2, and the two other in which is of order 2.

Lemma 2. Either is of order 6 or there exists an involution in such that and .

Lemma 3. Any element (not of order 1, 2 or 6) of is the image of under some nondegenerate homomorphism of into .

Theorem 1. The conjugacy classes of nondegenerate homomorphism of into are in one-to-one correspondence with the element of under the correspondence which maps each class to its parameter.
For each nondegenerate homomorphism , there exists an action of on . For the generators , and , we suppose , , and to have order 2, 3, and 2, respectively. If X and Y are matrices representing and , normalized by ; then, by taking , we can associate a parameter with the homomorphism . Assigning the parameter with is called parametrization. The canonical map associates a matrix to , where is a scalar. It can be seen thatis an invariant of . Here, will be an invariant if the characteristic equations of all the elements in a conjugacy class of are the same. If in addition , then by Theorem 1 there is a bijection between the elements in and the conjugacy class of . Specifically, there is a polynomial such that corresponding to each root of , a triplet can be obtained. Lemma 1, 2, and 3 guarantee the presentation of the triangle groups .
If X, Y, and T indicate elements of corresponding to the elements in then by this and the fact that are of orders 2, 3, and 2, respectively, the matrices X, Y, and T arewhere . Also, . The determinant of matrix Y is fixed to be , which gives .
For the conjugacy class of , consider the characteristic equations of the matrices X, Y, and XY, which arewhere and . If , then For with , the corresponding polynomial is .
Ultimately, by using the values of in the abovementioned equations, the values of the entries of matrices X, Y, and T are

3.1. Action of on Projective Line over the Finite Field

The action of on the projective line over the finite field is defined by the map . The linear fractional transformations of the generators and of act on each element of producing the following permutations of and :

: (055 000)(157 001)(019 002)(183 003)(004 020)(192 005)(006 150)(007 096)(008 024)(009 026)(029 010) (034 011)(012 044)(013 074)(014 inf)(211 015)(016 241)(251 017)(018 256)(021 189)(022 135)(023 093) (025 102)(027 128)(028 230)(203 030)(207 031)(032 182)(092 033)(035 158)(036 058)(037 179)(140 038) (039 063)(071 040)(041 126)(122 042)(043 136)(153 045)(237 046)(047 129)(048 239)(049 049)(098 050) (051 061)(052 053)(141 054)(056 086)(057 168)(184 059)(060 225)(062 077)(064 167)(164 065)(066 171) (067 105)(068 070)(069 083)(072 075)(073 209)(076 212)(078 254)(079 191)(080 200)(081 109)(082 255) (084 160)(085 205)(087 154)(088 166)(116 089)(090 162)(091 100)(094 206)(095 137)(165 097)(099 104) (226 101)(253 103)(106 248)(107 146)(108 161)(110 174)(175 111)(112 155)(113 138)(219 114)(115 133) (117 228)(118 221)(119 197)(188 120)(220 121)(123 195)(124 177)(125 201)(250 127)(130 173)(131 198) (132 240)(134 142)(139 178)(143 151)(144 231)(247 145)(147 172)(148 190)(149 242)(152 170)(156 238) (159 244)(243 163)(169 196)(176 204) (180 218)(181 186)(185 194)(235 187)(193 252)(199 229)(202 216) (208 223)(210 213)(214 245)(215 217)(222 246)(224 234)(227 249)(232 233)(236 236)

: (000 241 inf)(121 242 001)(256 120 240)(113 002 100)(239 128 141)(230 070 003)(171 011 238)(004 090 177)(151 237 064)(087 005 049)(236 154 192)(222 027 006)(214 019 235)(190 131 007)(110 051 234) (008 075 209)(166 233 302)(009 072 184)(169 232 057)(010 089 164)(152 231 077)(134 012 101) (229 107 140)(195 162 013)(079 046 228)(014 060 186)(181 227 055)(199 104 015)(137 042 226)(225 016 249) (148 105 017)(136 093 224)(189 084 018)(157 052 223)(074 020 050)(221 167 191)(132 033 021) (208 109 220)(022 115 206)(126 219 035)(145 174 023)(067 096 218)(059 024 045)(217 182 196) (163 056 025)(185 078 216)(153 073 026)(168 088 215)(111 085 028)(156 130 213)(179 029 040)(212 062 201)(095 044 030)(197 146 211)(175 183 031)(058 066 210)(173 034 036)(207 068 205)(116 037 097)(204 125 144)(119 099 038)(142 122 203)(129 039 243)(202 112 255)(147 041 248)(200 094 250) (043 061 247)(180 198 251)(047 102 159)(139 194 082)(150 048 253)(193 091 245)(149 081 053)(160 092 188)(103 054 246)(187 138 252)(086 063 244)(178 155 254)(165 071 065)(170 076 176)(127 133 069)(108 114 172)(135 080 083)(161 106 158)(124 123 098)(118 117 143).

3.2. Coset Diagram of the Action

The coset diagram for the action of on consists of two types of the circuits, given below (Figures 3 and 4):

(i)In Type-I circuit, there are four triangles and this type of circuit occurs twenty-one times in the coset diagram. There is no fix point of nor of in Type-I circuit. Thus, Type-I circuits utilized 252 vertices of the coset diagram.(ii)In Type-II circuit, there are only two triangles and this type of circuit occurs only once in the coset diagram. In this circuit, there are two fixed points of . Thus, Type-II circuit utilized only six vertices of the coset diagram.

4. Construction of S-Box Using a Coset Diagram

After making the coset diagram, we proceed towards construction of the S-box from the coset diagram. There are twenty-two circuits in the coset diagram, so the first step is how to choose a circuit. The second step is the selection of vertices of that circuit in a specific manner. Therefore, for the first part, instead of randomly choosing the circuits we choose the circuits by using a sequence, known as Fibonacci sequence . We define mapping as by Sum of the first terms of the Fibonacci sequence. Then, choose the circuit in which occurs. By this mapping, we can easily and systematically choose the circuits one by one. For illustration, , we pick the circuit of the coset diagram having 0 as the vertex, that is, the circuit shown in Figure 5. Similarly, for and so on.

Secondly, after choosing the circuit of the coset diagram, now we select the vertices of that circuit in a special manner. We initiate from the vertex and apply , (because of the third relator of ) on and note the vertices, which are (0, 181, 14). Then, in the same circuit we choose the smallest number from the remaining vertices of the circuit, which is 16, apply and its powers to get (16, , 60). Continue the process by choosing the smallest from the remaining vertices of the circuit and apply and its powers so that all the vertices of the circuit are utilized. We can view all the entries of the circuit containing in the first row of Table 2, except infinity. It is important to mention here that if appears in the previous circuit then it means it is already utilized so move on. But, if appears in the new circuit, then apply and its powers in the similar fashion and note the permutation. Continue the process till all the vertices of the coset diagram are exhausted yielding 258 entries in an order. Ignore and 256. Thus, a S-box is constructed as shown in Table 2. It is important to mention here that whenever take modulo class 257. It seems easy to find in modulo class 257 but this is not so. We had to use an online PowerMod Calculator for these calculations.

The entire scheme of constructing an S-box is based on the action of a finite triangle group , coset diagram, and Fibonacci sequence. These all inculcate the natural patterns in the scheme which gives a very suitable and effective S-box as a result.

For more variability, we apply one of the permutations from on the outcome presented in Table 2 to change the positions of the elements. This permutation increases the randomness of the elements and gives the proposed S-box with high nonlinearity, as shown in Table 3. The permutation used here is as follows:

(01 195 199 236 194 185 207 251 082 026 096 155 104 175 052 132 197 030 149 216 233 167 043 118 024 011 221 146 047 241 171 140 090 148 248 121 242 069 008 055 240 042 045 200 143 162 021 142 190 157 131 074 184 161 127 062 218 211 124 208 097 153 039 087 202 041 100 066 072 170 232 178 065 010 073 007 015 059 238 231 122 058 234 182 023 219 061 086 133 051 247 018 048 222 137 098 077 125 228 014 029 220 165 094 214 166 003 244 130 209 112 189 203 169 033 243 187 076 113 145 070 255 053 037 168 107 223 226 224 116 108 044 006 114 068 054 180 103 046 204 201 111 147 159 013 213 181 129 225 078 177 152 115 016 093 019 109 079 227 229 085 192 176 188 057 212 235 063 193 249 105 173 164 102 084 040 253 210 237 239 080 217 099 071 134 034 110 049 135 089 035 032 009 036 215 128 092 191 139 117 138 252 038 245 163 246 160) (000 151 083 172 020 183 028 150 198 230 120 056 067 205 136 027 095 064 002 106 250 174) (005 088 179 141 156 050 154 060 081 158 123 101 025 254 031 012 126 196 091 186 075 206 144 022) (004) (017) (119).

5. Analysis for Evaluating the Strength of S-Box

The criteria generally selected to test the S-box are nonlinearity, strict avalanche criteria, bit independence criteria, linear approximation probability, and differential approximation probability. For testing the strength of the proposed S-box, we discuss each of them in the following. We also compare the results with recently developed S-boxes.

5.1. Nonlinearity

Nonlinearity (NL) is one of the significant criteria for the performance evaluation of the S-box which measures the randomness of the values of the S-box. The NL of proposed S-box is 110.50 which is higher than that of [21–44]. The higher the NL, the stronger the S-box. Hence, the NL of the proposed S-box guarantees a secure communication. The NL of the proposed S-box is expressed in Table 4 and comparison with [21–44] is in Table 7.

5.2. Strict Avalanche Criteria

The concept of strict avalanche criteria (SAC) was introduced by Webster and Tavares [45] which measures the confusion creation of an S-box by measuring the change in output bits due to the change in input bits. The minimum and the maximum value of SAC of the proposed S-box are 0.40625 and 0.578125, whereas the average value is 0.503175 (Table 5) which is much closer to 0.5, the ideal value of SAC. The lesser deviation from 0.5, the stronger the S-box. The comparison of SAC of the proposed S-box with that of [21–44] is in Table 7, which depicts that the proposed S-box has better SAC performance.

5.3. Bit Independence Criteria

Bit independence criteria also measures the strength of the S-box. The BIC value of the generated S-box is 109.21 (Table 6). The comparison with that of [21–44] is in Table 7. This BIC value is sufficiently good and assures secure communication and better encryption in cryptographic application.

5.4. Linear Approximation Probability

Linear approximation probability (LAP) criteria measure the strength or resistance of the S-box against linear attacks. The smaller the LAP value, the higher the strength of security of the S-box. The LAP of the generated S-box is 0.0859375 which is smaller than that of [21–44]. This depicts that the proposed scheme has ability to generate a strong, efficient, and attack-resistant S-box.

5.5. Differential Approximation Probability

Differential approximation probability (DAP) is a measure to analyse the resistance of the S-box against differential attacks. The smaller the DAP, the higher the resistance against attacks. The DAP of the generated S-box is 0.0234375 which is exceptionally good. This DAP value is near to the optimal value 0.0156. This reflects that the S-box generated by group action and using coset diagrams has the ability of high resistance against differential attacks.

The comparison of NL, SAC, BIC, LAP, and DAP with other known S-boxes is given in Table 7. The NL and the BIC value of the proposed S-box are higher than that of the others. The least values of LAP and DAP show the proposed S-box is highly resistive against the linear as well as differential attacks. And the confusion/diffusion creation criteria SAC is also closer to the standard value 0.5000. Hence, the perfect combination of all (NL, SAC, BIC, LAP, and DAP) shows the proposed S-box is a secure choice for encryption.

6. Majority Logic Criteria

Majority logic criteria measure image encryption strength of the S-box. Entropy, correlation, contrast, energy, and homogeneity are the components of MLC. We used JPEG image of a baboon for this analysis. Figures 6(a) and 6(c) show the original image and the histogram, while Figures 6(b) and 6(d) show the encrypted image and encrypted histogram. Specially, the entropy value which is 7.9832 is better than that of [4, 24, 26, 46, 47]. The entropy value is very close to the ideal value, which is 8. The values of contrast, correlation, energy, and homogeneity also indicate the proposed scheme provides a strong S-box which is suitable for encryption applications. The results of this analysis in comparison with well-known S-boxes are in Table 8.

(a)

(b)

(c)

(d)

7. Application of Proposed S-Box in Multimedia Security

The generated S-box is also being applied for watermarking technique to determine its application in multimedia security. From the outcomes of the analyses (Table 9), it can be seen that our S-box has the tendency to create confusion. Therefore, it meets the necessary requirements to be reliable in multimedia applications. In watermarking scheme, the watermark is first encrypted with the proposed S-box and then embedded into the host image. This additional encryption would provide additional security as the inverse of S-box is required for the extraction of watermark. This will add more security to our scheme and will support copyrights protection. As frequency domain technique is more robust as compared to spatial domain, discrete cosine transform is used for watermarking technique and S-box-substituted watermark is embedded into the DCT-transformed host image (Figures 7–10).

(a)

(b)

(c)

(a)

(b)

(c)

8. Results and Discussion

Table 7 shows the performance comparison of our S-box with other S-boxes based on the cryptographic properties. Our findings are as follows:(1)A high value of nonlinearity provides resistance against linear cryptanalysis. The average nonlinearity of our S-box is superior to the rest of the S-boxes in Table 7. This results in decent confusion, and makes the proposed S-box resilient against linear cryptanalysis.(2)The SAC value near 0.5 (the perfect value for SAC) is the ultimate goal of every S-box designer. Table 7 depicts that our SAC value (0.503) is very close to this perfect value. We can say that our S-box satisfies the SAC.(3)Similarly, the BIC value of our S-box is better than the BIC values of all other S-boxes in Table 7.(4)Any S-box with a lesser value of DAP is more resilient against differential cryptanalysis. The DAP value of our S-box is 0.0234, which is better than the DAP values of other S-boxes in Table 7. This value of DAP reflects the strength of our S-box.(5)To defy linear cryptanalysis, a smaller value of LAP for a given S-box is desired by S-box designers. The LAP value of our S-box is 0.086, better than all S-boxes developed in [21–44]. Due to this small value, we can say that our S-box is resistant to linear cryptanalysis.(6)The JPEG image of the baboon is used for this MLC. The values of entropy, contrast, correlation, energy, and homogeneity show that our S-box is suitable for encryption applications.

9. Conclusions

An efficient scheme for the construction of an S-box is presented in this paper. The proposed S-box is constructed by taking action of a quotient of the modular group on the projective line over the finite field . The newly constructed S-box is applied for image encryption and watermarking schemes as well. The proposed S-box has high resistance against linear attacks as well as for differential attacks. The results of security strength measuring tests: NL, SAC, BIC, LAP, and DAP all are very close to ideal values. This depicts that the proposed scheme is highly preferable for constructing an S-box for cryptographic applications.

Data Availability

The evaluation data used to support the findings of this study are available from the corresponding author upon request.

Disclosure

This article has been taken from the Ph.D. thesis of Imran Shahzad supervised by Prof. Dr. Qaiser Mushtaq.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Authors’ Contributions

Dr. Abdul Razaq reviewed the paper and gave helpful suggestions.

References

A. Belazi, A. A. A. El-Latif, R. Rhouma, and S. Belghith, “Selective image encryption scheme based on DWT, AES S-box and chaotic permutation,” in Proceedings of the 2015 International Wireless Communications and Mobile Computing Conference (IWCMC), pp. 606–610, IEEE, Dubrovnik, Croatia, August 2015.
View at: Publisher Site | Google Scholar
A. Belazi, A. A. Abd El-Latif, and S. Belghith, “A novel image encryption scheme based on substitution-permutation network and chaos,” Signal Processing, vol. 128, pp. 155–170, 2016.
View at: Publisher Site | Google Scholar
D. E. Standard, National Bureau of Standards, NBS FIPS PUB 46, National Bureau of Standards. US, Department of Commerce, Gaithersburg, MD, USA, 1977.
J. Daemen and V. Rijmen, The Design of Rijndael: AES-The Advanced Encryption Standard, Springer Science & Business Media, Berlin, Germany, 2013.
L. Cui and Y. Cao, “A new S-box structure named affine-power-affine,” International Journal of Innovative Computing, Information and Control, vol. 3, no. 3, pp. 751–759, 2007.
View at: Google Scholar
E. Biham and A. Shamir, “Differential cryptanalysis of DES-like cryptosystems,” Journal of Cryptology, vol. 4, no. 1, pp. 3–72, 1991.
View at: Publisher Site | Google Scholar
T. Shah, I. Hussain, M. A. Gondal, and H. Mahmood, “Statistical analysis of S-box in image encryption applications based on majority logic criterion,” International Journal of Physical Sciences, vol. 6, no. 16, pp. 4110–4127, 2011.
View at: Publisher Site | Google Scholar
I. Hussain, T. Shah, H. Mahmood, M. A. Gondal, and U. Y. Bhatti, “Some analysis of S-box based on residue of prime number,” Proceedings of the Pakistan Academy of Sciences, vol. 48, no. 2, pp. 111–115, 2011.
View at: Google Scholar
M. Asim and V. Jeoti, “Efficient and simple method for designing chaotic S-boxes,” ETRI Journal, vol. 30, no. 1, pp. 170–172, 2008.
View at: Publisher Site | Google Scholar
E. Al Solami, M. Ahmad, C. Volos, M. Doja, and M. Beg, “A new hyperchaotic system-based design for efficient bijective substitution-boxes,” Entropy, vol. 20, no. 7, p. 525, 2018.
View at: Publisher Site | Google Scholar
Y. Wang, L. Yang, M. Li, and S. Song, “A method for designing S-box based on chaotic neural network,” in Proceedings of the 2010 6th International Conference on Natural Computation, vol. 2, pp. 1033–1037, IEEE, Yantai, China, August 2010.
View at: Publisher Site | Google Scholar
J. Peng, A. A. A. El-Latif, A. Belazi, and Z. Kotulski, “Efficient chaotic nonlinear component for secure cryptosystems,” in Proceedings of the 9th International Conference on Ubiquitous and Future Networks (ICUFN), pp. 989–993, IEEE, Milan, Italy, July 2017.
View at: Publisher Site | Google Scholar
G. Chen, Y. Chen, and X. Liao, “An extended method for obtaining S-boxes based on three-dimensional chaotic Baker maps,” Chaos, Solitons & Fractals, vol. 31, no. 3, pp. 571–579, 2007.
View at: Publisher Site | Google Scholar
U. Hayat and N. A. Azam, “A novel image encryption scheme based on an elliptic curve,” Signal Processing, vol. 155, pp. 391–402, 2019.
View at: Publisher Site | Google Scholar
A. Altaleb, M. S. Saeed, I. Hussain, and M. Aslam, “An algorithm for the construction of substitution box for block ciphers based on projective general linear group,” AIP Advances, vol. 7, no. 3, Article ID 035116, 2017.
View at: Publisher Site | Google Scholar
G. Higman and Q. Mushtaq, “Coset diagrams and relations for .,” The Arab Gulf Journal of Scientific Research, vol. 1, no. 1, pp. 159–164, 1983.
View at: Google Scholar
Q. Mushtaq, “Modular group acting on real quadratic fields,” Bulletin of the Australian Mathematical Society, vol. 37, no. 2, pp. 303–309, 1988.
View at: Publisher Site | Google Scholar
A. Rafiq and Q. Mushtaq, “Coset diagrams of the modular group and continued fractions,” Comptes Rendus Mathematique, vol. 357, no. 8, pp. 655–663, 2019.
View at: Publisher Site | Google Scholar
A. Torstensson, “Coset diagrams in the study of finitely presented groups with an application to quotients of the modular group,” Journal of Commutative Algebra, vol. 2, no. 4, pp. 501–514, 2010.
View at: Publisher Site | Google Scholar
Q. Mustaq, “Parametrization of all homomorphisms from into ,” Communications in Algebra, vol. 20, no. 4, pp. 1023–1040, 1992.
View at: Publisher Site | Google Scholar
G. Jakimoski and L. Kocarev, “Chaos and cryptography: block encryption ciphers based on chaotic maps,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 48, no. 2, pp. 163–169, 2001.
View at: Publisher Site | Google Scholar
G. Tang, X. Liao, and Y. Chen, “A novel method for designing S-boxes based on chaotic maps,” Chaos, Solitons & Fractals, vol. 23, no. 2, pp. 413–419, 2005.
View at: Publisher Site | Google Scholar
A. Belazi and A. A. A. El-Latif, “A simple yet efficient S-box method based on chaotic sine map,” Optik, vol. 130, pp. 1438–1444, 2017.
View at: Publisher Site | Google Scholar
A. Ullah, S. S. Jamal, and T. Shah, “A novel construction of substitution box using a combination of chaotic maps with improved chaotic range,” Nonlinear Dynamics, vol. 88, no. 4, pp. 2757–2769, 2017.
View at: Publisher Site | Google Scholar
Y. Wang, P. Lei, and K. W. Wong, “A method for constructing bijective S-box with high nonlinearity based on chaos and optimization,” International Journal of Bifurcation and Chaos, vol. 25, no. 10, Article ID 1550127, 2015.
View at: Publisher Site | Google Scholar
A. Razaq, A. Yousaf, U. Shuaib, N. Siddiqui, A. Ullah, and A. Waheed, “A novel construction of substitution box involving Coset diagram and a bijective map,” Security and Communication Networks, vol. 2017, Article ID 5101934, 16 pages, 2017.
View at: Publisher Site | Google Scholar
L. Liu, Y. Zhang, and X. Wang, “A novel method for constructing the S-box based on spatiotemporal chaotic dynamics,” Applied Sciences, vol. 8, no. 12, p. 2650, 2018.
View at: Publisher Site | Google Scholar
A. A. Alzaidi, M. Ahmad, M. N. Doja, M. Maftab Khan, and M. S. Beg, “A new 1D chaotic map and β-hill climbing for generating substitution-boxes,” IEEE Access, vol. 6, pp. 55405–55418, 2018.
View at: Publisher Site | Google Scholar
Y. Wang, K. W. Wong, C. Li, and Y. Li, “A novel method to design S-box based on chaotic map and genetic algorithm,” Physics Letters A, vol. 376, no. 6-7, pp. 827–833, 2012.
View at: Publisher Site | Google Scholar
W. Yong and L. Peng, “An improved method to obtaining S-box based on chaos and genetic algorithm,” HKIE Transactions, vol. 19, no. 4, pp. 53–58, 2012.
View at: Publisher Site | Google Scholar
R. Guesmi, C. L. P. Farah, A. Kachouri, and M. Samet, “A novel design of chaos based S-boxes using genetic algorithm techniques,” in Proceedings of the IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA), pp. 678–684, IEEE, Doha, Qatar, November 2014.
View at: Publisher Site | Google Scholar
M. Ahmad, D. Bhatia, and Y. Hassan, “A novel ant colony optimization-based scheme for substitution box design,” Procedia Computer Science, vol. 57, pp. 572–580, 2015.
View at: Publisher Site | Google Scholar
Y. Tian and Z. Lu, “S-box: six-dimensional compound hyperchaotic map and artificial bee colony algorithm,” Journal of Systems Engineering and Electronics, vol. 27, no. 1, pp. 232–241, 2016.
View at: Google Scholar
M. Ahmad, N. Mittal, P. Garg, and M. M. Khan, “Efficient cryptographic substitution box design using travelling salesman problem and chaos,” Perspectives in Science, vol. 8, pp. 465–468, 2016.
View at: Publisher Site | Google Scholar
T. Özkaynak, R. Rhouma, and S. Belghith, “A novel method for designing S-box based on chaotic map and teaching–learning-based optimization,” Nonlinear Dynamics, vol. 88, no. 2, pp. 1059–1074, 2017.
View at: Publisher Site | Google Scholar
H. A. Ahmed, M. F. Zolkipli, and M. Ahmad, “A novel efficient substitution-box design based on firefly algorithm and discrete chaotic map,” Neural Computing and Applications, vol. 30, no. 171, pp. 1–10, 2018.
View at: Google Scholar
T. Zhang, C. P. Chen, L. Chen, X. Xu, and B. Hu, “Design of highly nonlinear substitution boxes based on I-Ching operators,” IEEE Transactions on Cybernetics, vol. 48, no. 12, pp. 3349–3358, 2018.
View at: Publisher Site | Google Scholar
D. Lambić, “A novel method of S-box design based on chaotic map and composition method,” Chaos, Solitons & Fractals, vol. 58, pp. 16–21, 2014.
View at: Publisher Site | Google Scholar
D. Lambić, “A novel method of S-box design based on discrete chaotic map,” Nonlinear Dynamics, vol. 87, no. 4, pp. 2407–2413, 2017.
View at: Publisher Site | Google Scholar
A. Ullah, S. S. Jamal, and T. Shah, “A novel algebraic technique for the construction of strong substitution box,” Wireless Personal Communications, vol. 99, no. 1, pp. 213–226, 2018.
View at: Publisher Site | Google Scholar
F. Özkaynak, “Construction of robust substitution boxes based on chaotic systems,” Neural Computing and Applications, vol. 31, no. 8, pp. 3317–3326, 2019.
View at: Publisher Site | Google Scholar
T. Ye and L. Zhimao, “Chaotic S-box: six-dimensional fractional Lorenz–Duffing chaotic system and O-shaped path scrambling,” Nonlinear Dynamics, vol. 94, no. 3, pp. 2115–2126, 2018.
View at: Publisher Site | Google Scholar
V. M. Silva-García, R. Flores-Carapia, C. Rentería-Márquez, B. Luna-Benoso, and M. Aldape-Pérez, “Substitution box generation using chaos: an image encryption application,” Applied Mathematics and Computation, vol. 332, pp. 123–135, 2018.
View at: Publisher Site | Google Scholar
L. Yi, X. Tong, Z. Wang, M. Zhang, H. Zhu, and J. Liu, “A novel block encryption algorithm based on chaotic S-box for wireless sensor network,” IEEE Access, vol. 7, pp. 53079–53090, 2019.
View at: Publisher Site | Google Scholar
A. F. Webster and S. E. Tavares, “On the design of S-boxes,” in Proceedings of the 1985 Conference on the Theory and Application of Cryptographic Techniques, pp. 523–534, Springer, Linz, Austria, April 1985.
View at: Google Scholar
M. Khan, T. Shah, and S. I. Batool, “Construction of S-box based on chaotic Boolean functions and its application in image encryption,” Neural Computing and Applications, vol. 27, no. 3, pp. 677–685, 2016.
View at: Publisher Site | Google Scholar
A. Belazi, M. Khan, A. A. A. El-Latif, and S. Belghith, “Efficient cryptosystem approaches: S-boxes and permutation–substitution-based encryption,” Nonlinear Dynamics, vol. 87, no. 1, pp. 337–361, 2017.
View at: Publisher Site | Google Scholar

Copyright

Copyright © 2019 Imran Shahzad et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

3871

Downloads

1247

Citations