Research article

Study of power law non-linearity in solitonic solutions using extended hyperbolic function method

  • Received: 18 March 2022 Revised: 05 July 2022 Accepted: 18 July 2022 Published: 19 August 2022
  • MSC : 35Q51, 35Q53

  • This paper retrieves the optical solitons to the Biswas-Arshed equation (BAE), which is examined with the lack of self-phase modulation by applying the extended hyperbolic function (EHF) method. Novel constructed solutions have the shape of bright, singular, periodic singular, and dark solitons. The achieved solutions have key applications in engineering and physics. These solutions define the wave performance of the governing models. The outcomes show that our scheme is very active and reliable. The acquired results are illustrated by 3-D and 2-D graphs to understand the real phenomena for such sort of non-linear models.

    Citation: Muhammad Imran Asjad, Naeem Ullah, Asma Taskeen, Fahd Jarad. Study of power law non-linearity in solitonic solutions using extended hyperbolic function method[J]. AIMS Mathematics, 2022, 7(10): 18603-18615. doi: 10.3934/math.20221023

    Related Papers:

    [1] Abdul Razaq, Muhammad Mahboob Ahsan, Hanan Alolaiyan, Musheer Ahmad, Qin Xin . Enhancing the robustness of block ciphers through a graphical S-box evolution scheme for secure multimedia applications. AIMS Mathematics, 2024, 9(12): 35377-35400. doi: 10.3934/math.20241681
    [2] Mohammad Mazyad Hazzazi, Gulraiz, Rashad Ali, Muhammad Kamran Jamil, Sameer Abdullah Nooh, Fahad Alblehai . Cryptanalysis of hyperchaotic S-box generation and image encryption. AIMS Mathematics, 2024, 9(12): 36116-36139. doi: 10.3934/math.20241714
    [3] Fatma S. Alrayes, Latifah Almuqren, Abdullah Mohamed, Mohammed Rizwanullah . Image encryption with leveraging blockchain-based optimal deep learning for Secure Disease Detection and Classification in a smart healthcare environment. AIMS Mathematics, 2024, 9(6): 16093-16115. doi: 10.3934/math.2024779
    [4] Hafeez Ur Rehman, Mohammad Mazyad Hazzazi, Tariq Shah, Amer Aljaedi, Zaid Bassfar . Color image encryption by piecewise function and elliptic curve over the Galois field GF(2n). AIMS Mathematics, 2024, 9(3): 5722-5745. doi: 10.3934/math.2024278
    [5] Mohammad Mazyad Hazzazi, Amer Aljaedi, Zaid Bassfar, Misbah Rani, Tariq Shah . 8×8 S-boxes over Klein four-group and Galois field GF(24): AES redesign. AIMS Mathematics, 2024, 9(5): 10977-10996. doi: 10.3934/math.2024537
    [6] Yuzhen Zhou, Erxi Zhu . A new image encryption based on hybrid heterogeneous time-delay chaotic systems. AIMS Mathematics, 2024, 9(3): 5582-5608. doi: 10.3934/math.2024270
    [7] Muhammad Sajjad, Tariq Shah, Huda Alsaud, Maha Alammari . Designing pair of nonlinear components of a block cipher over quaternion integers. AIMS Mathematics, 2023, 8(9): 21089-21105. doi: 10.3934/math.20231074
    [8] Erdal Bayram, Gülşah Çelik, Mustafa Gezek . An advanced encryption system based on soft sets. AIMS Mathematics, 2024, 9(11): 32232-32256. doi: 10.3934/math.20241547
    [9] Shamsa Kanwal, Saba Inam, Fahima Hajjej, Ala Saleh Alluhaidan . Securing air defense visual information with hyperchaotic Folded Towel Map-Based encryption. AIMS Mathematics, 2024, 9(11): 31217-31238. doi: 10.3934/math.20241505
    [10] Mohammad Mazyad Hazzazi, Farooq E Azam, Rashad Ali, Muhammad Kamran Jamil, Sameer Abdullah Nooh, Fahad Alblehai . Batch generated strongly nonlinear S-Boxes using enhanced quadratic maps. AIMS Mathematics, 2025, 10(3): 5671-5695. doi: 10.3934/math.2025262
  • This paper retrieves the optical solitons to the Biswas-Arshed equation (BAE), which is examined with the lack of self-phase modulation by applying the extended hyperbolic function (EHF) method. Novel constructed solutions have the shape of bright, singular, periodic singular, and dark solitons. The achieved solutions have key applications in engineering and physics. These solutions define the wave performance of the governing models. The outcomes show that our scheme is very active and reliable. The acquired results are illustrated by 3-D and 2-D graphs to understand the real phenomena for such sort of non-linear models.



    Telemedicine is a rapidly expanding discipline that provides health services remotely, wherein the patient and the physician do not live in the same geographical region. The patient's personal data, especially medical images, is communicated via online or cellphone-networked routes. This contemporary healthcare system requires an infrastructure that has the ability to preserve medical images in such a manner that they are visible only to permitted users, regardless of their geographic location. This infrastructure could be provided through cloud storage networks. However, such systems are susceptible to cyber-attacks if they are not built according to proper safety standards. The primary focus of many researchers in the information security field has been the development of computing-based tactics aimed at enhancing patient care. However, there is a notable gap in the methodologies employed to achieve the desired level of privacy for sensitive data within communication channels and storage systems. In these circumstances, one option for safeguarding medical images is to utilize encryption algorithms. These algorithms encrypt the images in a manner that renders them indecipherable to users who do not possess the encryption key. References [1,2,3,4,5,6,7] highlight several security measures for telemedicine applications.

    The substitution-box (S-Box) is a crucial part of the encryption process and one of the most significant components in cryptography [8]. An s×s S-box is a special kind of Boolean function that can be defined as;

    ψ(u):(h1(u),h2(u),h3(u),,hs(u)):Zs2Zs2,

    where Z2 is a finite field of order 2. The substitution-box is used to create perplexity and uncertainty in actual data, and the robustness of the cryptosystem depends upon the ability of the S-box to scramble the information into an unreadable format. The use of the S-box aids in achieving Shannon's confusion characteristics. These characteristics strengthen block ciphers against differential and linear attacks [9,10]. After the successful implementation of AES, which uses 8×8 S-boxes, experts in this field have been interested in the construction of cryptographically robust 8×8 S-boxes [11,12,13,14,15,16,17,18].

    In recent years, there have been numerous advancements in the field of image encryption systems, resulting in the emergence of various schemes that can be categorized based on their underlying encryption methods. These methods include DNA encryption, chaotic system approach, wavelet transform encryption, compressive sensing encryption, and the S-box approach. Ibrahim et al. [19] employed dynamic S-boxes and chaotic maps in their study to effectively encrypt medical images. The proposed system was designed to offer protection against reset attacks, as well as selected plaintext and ciphertext attacks. A comprehensive analysis of multiple image encryption schemes incorporating DNA coding and nonlinear dynamics was presented in [20], uncovering inherent vulnerabilities within these schemes. The authors demonstrated the application of S-boxes in executing chosen-plaintext attacks against the aforementioned schemes. In [21], a novel n-dimensional conservative chaos is generated for the purpose of image encryption utilizing the Generalized Hamiltonian System. Nematzadeh et al. [22] presented a hybrid model that combines an updated genetic scheme and coupled map lattices (CMLs) to enhance the encryption security and computational efficiency of medical images. Reference [23] elucidated the development of high-speed and low-area architectures specifically designed to accommodate the secure IoT encryption algorithm within resource-constrained IoT environments. The paper also introduced a dynamic block selection technique aimed at enhancing the efficiency of image encryption. Liu et al. proposed image encryption for color images in [24] by utilizing self-adapting permutation and DNA dynamic encoding. Hashim et al. [25] proposed a hybrid encryption technique that combines a quadratic map preprocessing step with AES for secure medical image transmission, thereby addressing the challenge of protecting patient privacy and data confidentiality. Based on the DNA-chaos cryptosystem, [26] revealed an innovative approach to encrypt medical images aimed at keeping telemedicine and other medical applications protected. Experimental results indicated the effectiveness of the proposed approach, which demonstrated its efficient processing time and robust encryption capabilities. Khan et al. [27] designed S-boxes with good cryptographic strength by utilizing true random values derived from medical imaging noise. In [28], a novel hybrid encryption technique based on S-box and Henon mappings for enhancing the security of multidimensional 3D medical images was presented. Hayat et al. [29] introduced an innovative approach to construct S-boxes by leveraging elliptic curves within finite order rings. Upon comparative assessment with contemporary methodologies, it becomes apparent that their proposed technique is better tailored for cryptographic applications. Notably, a resilient S-box exhibiting a substantial non-linearity of 109.75 is delineated in [30], employing the Q-learning naked mole rat method. Furthermore, the authors adeptly applied the suggested S-box for image encryption. In [31], the sine-cosine optimization procedure is employed to generate a bijective S-box, with the authors conducting rigorous testing against other S-boxes to establish its efficacy. Razaq et al. [32] introduced a novel approach that utilized group theory to generate an extensive number of S-boxes possessing algebraic properties similar to those of AES. S-boxes constructed by Ibrahim et al. [33] utilize permutated elliptic curves, exhibiting experimental efficiency an order of magnitude higher than comparable methods. Reference [34] introduces an efficient chaotic S-box, employed in the design of a streamlined cryptosystem demonstrating favorable encryption outcomes and security robustness. Alhadawi et al. [35] incorporated discrete chaotic maps and the cuckoo search algorithm in their S-box generation method, concluding that the resultant S-boxes exhibit robust cryptographic properties resistant to cryptanalysis. In [36], Khan et al. utilized a chaotic partial differential equation to design an S-box, implementing it to construct a secure communication-oriented cryptosystem. Khan et al. [37] proposed a novel S-box construction through the application of a fractional Rossler chaotic model, substantiating its efficacy in ensuring secure communication. Reference [38] introduces an effective S-box generated through the artificial bee colony method and discrete chaotic map. By employing a range of benchmark standard analyses, the authors validate the robustness of the S-box. Soto et al. [39] suggested a novel S-box generation method using a human behavior-based optimization system. Several investigations show that the offered method may efficiently create resilient S-boxes for encryption systems. In [40], Yan et al. employed a Nonlinear-Transform of 1D Chaotic Maps to create the S-box. The authors perform many security evaluations to show the resilience of the constructed S-box. Zhou et al. [41] proposed a chaos-based random S-box design algorithm that generated a large number of S-boxes by utilizing the spatial chaotic nature of spatiotemporal chaos. An innovative algorithm for generating S-boxes based on hyperchaotic systems is presented in reference [42]. The generated S-box is also incorporated into the design of an image encryption algorithm. In [43], a novel technique for deriving random bijective S-boxes using discrete chaotic maps is introduced. The performance test shows that the S-box has good cryptographic characteristics. In [44], a methodology is suggested to generate S-boxes using an efficient method based on the 3-D four-wing autonomous chaotic system. Comparing the proposed S-box to current ones demonstrates higher cryptographical performance. Furthermore, recent advancements in image encryption methods can be found in references [45,46,47,48,49,50].

    The present study contributes significantly in the following ways:

    i. A novel approach is formulated for the generation of substitution-boxes by combining a permutation group and a multiplicative cyclic group of order 256.

    ii. To assess the performance of the suggested S-box, many standard algebraic parameters are applied. The findings obtained from various assessment methods confirm the reliability of the proposed S-box in preventing numerous assaults.

    iii. A robust image encryption algorithm that integrates the generated substitution-box with bit-plane slicing, circular shifting, and XOR operations is developed.

    iv. The security of the encryption algorithm is assessed using benchmark evaluations designed for image encryption techniques. The outcomes show that the proposed encryption approach can encrypt medical images effectively.

    In this section, we discuss some mathematical concepts utilized to our S-box design scheme.

    A set Ψ is said to constitute a group under the binary operation "*"if the following conditions hold.

    i. Closure Law

    For all μ,νΨ,we have μνΨ.

    ii. Associative Law

    For all μ,ν,σΨ, we have μ(νσ) = (,μν)σ

    iii. Existence of Identity

    For each μΨ, there is an element eΨsuchthateμ=μe=μ.

    e is called the identity element in Ψ, it has no effect on each element of Ψ under "*".

    iv. Existence of Inverse

    For each μΨ,thereisanelementμ1Ψsuchthatμ1μ=μμ1=e.

    μ and μ1 are called inverses of each other.

    Let Ψ be a group under some binary operation "*". Then, Ψ is called a cyclic group if it has at least one element a that can generate the entire group Ψ. In other words, for all bΨ, there exists at least one element a in Ψ such that b={na:nZ, if Ψ is group under additionan:∈Z, if Ψ is group under multiplication.

    If such is the case, we say that a is the generator of the cyclic group Ψ. It is important to note that, in a cyclic group Ψ, a is not a unique element that generates Ψ rather Ψ has many elements other than a, acting as generator of Ψ.

    The following theorem enables us to identify all generators of any finite cyclic group Ψ.

    Theorem 1. Let Ψ be a cyclic group with n elements and a be its one of the generators. Then am also generates Ψ if and only if m and n are relatively prime.

    Thus, to find all generators of Ψ, we must first manually compute its one generator, say a. Next, we find all the positive integers that are relatively prime to n. Finally, we get the set {am:(m,n)=1} of all generators of Ψ.

    Let Ψ be a cyclic group with n elements and a be one of the generators. Then, a generates all the elements of Ψ randomly in the following way;

    a,a2,a3,,an=1.

    We call a,a2,a3,,an=1, a cycle of Ψ obtained by a. Such cyclic patterns create randomness in the elements of Ψ. For example, the cyclic patterns of (Z11{0},.) designed by its all four generators 2, 8, 7, and 6 are

    2,4,8,5,10,9,7,3,6,18,9,6,4,10,3,2,5,7,17,5,2,3,10,4,6,9,8,1

    and

    6,3,7,9,10,5,8,4,2,1

    respectively.

    An 8-bit S-box has 256 number of distinct elements presented randomly in a square matrix of order 16. In this work, we have used the cycle of multiplicative cyclic group (Z257{0},.) of order 256 to design our S-box. It is easy to verify that (Z257{0},.) is generated by 2. Also, the positive integers that are relatively prime to 256 are all odd positive integers. Thus,

    {2m(mod257):misodd}=
    {3,27,243,131,151,74,152,83,233,41,112,237,77,179,69,107,192,186,132,160,155,110,219,172,6,54,229,5,45,148,47,166,209,82,224,217,154,101,138,214,127,115,7,63,53,220,181,87,12,108,201,10,90,39,94,75,161,164,191,177,51,202,19,171,254,230,14,126,106,183,105,174,24,216,145,20,180,78,188,150,65,71,125,97,102,147,38,85,251,203,28,252,212,109,210,91,48,175,33,40,103,156,119,43,130,142,250,194,204,37,76,170,245,149,56,247,167,218,163,182,96,93,66,80,206,55,238,86}

    is the set of all generators of (Z257{0},.). Each of these 128 generators produce randomness in (Z257{0},.), which further evolves an S-box.

    The proposed technique for the generation of S-boxes considers the ideas of cyclic and permutation groups. Here, we detail the steps required to use them effectively and complete the task.

    Step 1.

    In this step, the trivial sequence 0,1,2,...,255 is randomised to generate the initial S-box. It is achieved using a cyclic pattern of (Z257{0},.) designed by one of its generators in association with the translation and mod (256) operation.

    Step 1.1.

    Generate (Z257{0},.) with the help of one of the generators 74. Consequently, a cycle shown in Figure 1 is formed.

    Figure 1.  Cyclic form of Z257{0} generated by 74. Step 1.2..

    In Step 1.1, we acquire 256 random data points ranging from 1 to 256. The initial S-box (see Table 1) is formed by adding 84 to each data input and then applying mod-256. That is, for each data input n, the corresponding entry of the S-box is n+84mod(256). The non-linearity of our initial S-box is 106.25, which demonstrates the effectiveness of using cyclic groups in the S-box construction.

    Table 1.  Initial S-box.
    158 163 20 157 89 197 222 17 192 109 135 4 2 110 209 83
    193 183 214 195 75 115 66 220 125 35 239 246 250 33 91 88
    123 143 82 119 104 23 122 70 3 184 32 18 10 188 71 77
    7 223 90 15 45 208 9 114 248 141 190 218 234 133 112 100
    240 64 73 224 164 93 236 25 14 227 129 74 42 243 29 53
    30 126 108 62 181 67 38 204 226 56 251 106 170 24 196 148
    194 1 37 130 147 120 178 101 58 142 8 41 169 206 117 213
    121 252 180 249 215 13 153 51 138 225 238 172 171 97 19 84
    11 6 149 12 80 228 203 152 233 60 34 165 167 59 216 86
    232 242 211 230 94 54 103 205 44 134 186 179 175 136 78 81
    46 26 87 50 65 146 47 99 166 241 137 151 159 237 98 92
    162 202 79 154 124 217 160 55 177 28 235 207 191 36 57 69
    185 105 96 201 5 76 189 144 155 198 40 95 127 182 140 116
    139 43 61 107 244 102 131 221 199 113 174 63 255 145 229 21
    231 168 132 39 22 49 247 68 111 27 161 128 0 219 52 212
    48 173 245 176 210 156 16 118 31 200 187 253 254 72 150 85

     | Show Table
    DownLoad: CSV

    Step 2.

    The Step 2 of the proposed S-box generation method is based on a permutation group G generated by three elements a,b and c, where

    a = (1,111, 86, 50,227,104,210,144,172,255, 68,200, 91,157, 88, 24,216, 72,115,247,112,188, 39, 41,184, 51,177,170, 7,147, 54,254,162,196, 94,128,201,213,214, 99,175,166,224, 65,130,117,181,161, 15,212,141,233, 22,129, 61,113,118,136,252, 28,235, 89, 44,204, 37,223, 14, 30,164,131, 85, 35, 21,241, 82,234,122,108,193, 9, 90,217, 67,109,195, 62,146, 63,137, 92, 42,101,150,189, 93, 5, 47,246,107, 10,244, 34, 98,148,145,218, 56, 76,182,190, 43, 53, 73, 38, 48, 18)

    b = (2, 29,225,125, 71,106,156, 52,124,202,165, 46,251, 33, 12, 3, 81,197,250,126, 11,138,160,120,199,143, 4,215,194, 13, 57,248, 96,176,154,230, 69, 23, 26,103, 31,198, 45, 8, 49,142, 97,209,158, 20,192,231, 66,116,169,127,149, 75, 84,114,207,239, 16, 55,132,155, 58,153,206,232, 32,237, 87,139,178,102,105,121,140,134, 40, 59, 25,123,220,159,219,203,245, 80,226,173,249, 70,236, 79, 78,151,163,191, 6,208,185,187,242,100,222, 95,228,186,168,211,221, 60,135, 27, 77,171, 19)

    c = (17,167,183,110, 83,205,243,229,253,256,180,133,240,119,174, 74,238,152,179).

    Using GAP, we note that the finite presentation of G is

    a,b,c:a116=b119=c19=aba1b1=aba1c1=bcb1c1=1.

    Furthermore, the order of G is 262276. Each element of G acting on the original S-box generates a new S-box. We apply all elements of G and determine that a15b76c7 is the most effective element in G as it converts the initial S-box into the most resilient S-box in terms of non-linearity score. This S-box is referred to as our generated S-box (see Table 2).

    Table 2.  Final S-box.
    143 17 62 68 56 189 175 174 104 96 9 129 38 111 201 130
    79 176 10 31 152 244 70 158 179 190 178 6 7 115 238 218
    94 242 13 119 107 8 86 236 151 27 89 46 78 166 199 109
    40 232 224 69 71 220 145 147 34 28 142 66 37 181 75 100
    222 29 33 45 228 5 139 67 156 237 197 54 91 135 97 123
    252 246 206 116 121 230 239 183 124 229 23 126 192 16 118 120
    53 112 55 2 225 214 125 114 163 136 169 18 50 160 1 101
    98 177 223 243 208 146 212 141 250 226 15 247 194 83 87 213
    102 211 234 196 154 171 35 21 48 12 42 231 84 210 182 217
    106 82 204 233 57 41 60 219 99 138 39 195 77 159 198 186
    26 25 81 11 249 162 193 134 103 251 76 36 20 153 90 58
    144 137 205 85 72 191 47 150 157 92 131 43 185 170 51 93
    95 0 149 180 140 63 44 14 207 64 188 209 108 61 235 216
    168 74 49 24 122 3 88 117 110 184 65 172 164 248 167 241
    59 4 113 148 245 165 128 255 155 161 215 200 203 227 173 80
    253 105 127 133 187 73 132 202 30 52 19 240 22 221 32 254

     | Show Table
    DownLoad: CSV

    The generated S-box has been evaluated using certain well-known performance metrics. These include non-linearity, differential and linear approximation probabilities, bit independence criterion, and strict avalanche criterion. The findings of these security analyses in relation to the suggested S-box are briefly summarized in this subsection.

    An S-Box is needed to create a particular level of disorder in the data to secure it from different security assaults by unauthorized individuals. The capacity of an S-Box to cause confusion is tested using the non-linearity analysis [51]. In general, the greater the nonlinearity score of an S-box, the more reliable it is. The average non-linearity of the suggested S-box is 111, which is sufficient to assert that the created S-box can protect the transmitted data against linear assaults.

    Biham and Shamir [52] proposed differential uniformity (DU) as an essential criterion for S-box assessment. To compute the DU score, the mapping between input and output bits is analyzed. This analysis is designed to ensure differential homogeneity. The differential δh at the input must be uniquely connected to differential δk at the output. The newly constructed S-box has a DU score of 6, confirming its immense resistance to differential attacks.

    Linear approximation probability (LP) is an analysis for determining the efficiency of an S-box against linear cryptanalysis [53]. This test examines an event's imbalance and calculates its maximum score. The maximum LP score of the constructed S-box is 0.078, reflecting its resistance to various linear assaults.

    Large avalanche effects are required to construct a robust cryptographic system. Strict avalanche criteria (SAC) were first proposed by Websters and Tavares [54]. According to this criterion, if a single binary bit in the input is reversed, the output will also have a 50% chance of bit reversal. The optimal SAC value is 0.5. The mean SAC score of our S-box is 0.5017 indicating that the designed S-box fulfils the SAC standards.

    The bit independence criterion (BIC), developed in [54], is another significant criterion for determining the quality of S-boxes. BIC requires that the Boolean mappings of the two output bits satisfy the NL and SAC requirements. The Boolean mapping of the two output bits in the proposed S-box satisfies the condition of nonlinearity, with an average BIC-NL value of 111.43. The average BIC-SAC score of our S-box is 0.5018, which indicates that the constructed S-box satisfies the SAC criteria.

    Table 3 provides a comprehensive comparison of the outcomes of the aforementioned analyses obtained from the proposed S-box with those obtained from recently constructed S-boxes.

    Table 3.  Comparison of the various analyses between different S-boxes.
    S-box Nonlinearity SAC BIC-SAC BIC-NL DU LP
    min max Avg
    Suggested S-box 110 112 111 0.5017 0.5018 111.43 6 0.0703
    Ref [29] 106 108 106.25 0.5112 0.4975 103.93 12 0.1484
    Ref [30] 108 110 109.75 0.4998 0.5041 104.14 10 0.1171
    Ref [31] 108 110 109.50 0.4985 0.5012 104.07 10 0.1328
    Ref [32] 108 112 110 0.5010 0.5007 104 10 0.1250
    Ref [33] 106 110 106.5 0.5010 0.4987 103.93 10 0.1250
    Ref [34] 106 108 107 0.4949 0.5019 102.29 12 0.1410
    Ref [35] 106 110 108.5 0.4995 0.5011 103.85 10 0.1090
    Ref [36] 98 108 104.25 0.4946 0.5036 102.85 16 0.1406
    Ref [37] 100 108 104.50 0.4978 0.4974 103.64 12 0.1328
    Ref [38] 108 110 109.75 0.5042 0.4987 110.6 6 0.0859
    Ref [39] 102 110 106.5 0.4943 0.5019 103.35 12 0.1468
    Ref [40] 104 108 105.5 0.5065 0.5031 103.57 10 0.1328
    Ref [41] 104 110 107 0.4993 0, 5050 103.29 10 0.1328
    Ref [42] 104 110 107 0.5007 0.5039 104.50 10 0.1250
    Ref [43] 106 108 106.75 0.5034 0.5016 103.79 10 0.1250
    Ref [44] 104 108 105.75 0.4976 0.5002 104.50 10 0.1250
    Ref [45] 102 108 104.50 0.4980 0.4995 104.64 12 0.1172
    Ref [46] 100 106 104.00 0.5027 0.4947 103.21 12 0.1250
    Ref [47] 106 110 108.25 04985 0.5011 103 10 0.1250
    Ref [48] 106 108 106.25 0.5010 0.5001 103.14 12 0.132
    Ref [49] 108 112 110 0.5034 0.4995 103.50 10 0.132
    Ref [50] 98 106 102.75 0.4978 0.5020 103.36 12 0.1328

     | Show Table
    DownLoad: CSV

    Medical imaging plays a crucial role in diagnosing and treating various medical conditions. However, the sensitive nature of medical images necessitates their protection against unauthorized access and tampering during transmission and storage. Encryption is a fundamental technique used to secure such images. This section introduces a new encryption scheme for medical images that addresses their exclusive security needs.

    An image P is turned into a one-dimensional series and then into hexadecimal form. The SHA-512 method generates a 512-bit hash, which is then split into two components and placed back together in a 16×16 matrix. Further modification requires dividing the hash into 64 8-bit pieces. New S-boxes and images undergo bit-plane slicing. The hash components and S-box planes are combined via bitwise XOR. Modulus operations with pre-set values p1 to p6 choose bitplanes for circular shifting. Block-wise exclusive OR operations occur between image bitplanes and the modified S-box. Integrating the processed bitplanes creates an 8-bit encoded image, C, with planes rearranged. C undergoes substitution procedures based on T values and S-box elements. Finally, the encrypted image E is reshaped into a 2D matrix. The simulation settings include predefined values for p1 to p6 and an initial value C0 within the range [0,255]. The encryption procedure aims to enhance the security of the image data through a combination of hash functions, bit-plane manipulations, and substitution operations.

    In this study, a set of six grayscale medical images, along with three additional grayscale images (Lena, Barabara, and Tree), all with dimensions of 256×256, were subjected to encryption. The purpose was to determine whether significant statistical differences exist between the encrypted images and their corresponding original versions. The experimental findings presented in this paper substantiate the robustness and high level of security exhibited by the proposed algorithm. All experimental simulations were carried out using the MATLAB software. The collection of nine plaintext images utilized in this research was obtained from reputable sources such as (https://medpix.nlm.nih.gov/home) and (https://sipi.usc.edu/database/). Figure 2 displays both the original and encrypted images, illustrating their distinctiveness and indicating the efficacy of the encryption algorithm in successfully encrypting the tested images.

    Figure 2.  Initial and distorted versions of images selected for Image encryption.

    A series of operations and functions are utilized during the decryption procedure in order to restore the encrypted image E to its original state P. To commence the decryption process, the 2D encrypted Image 1s converted into a 1D array denoted as C. Subsequently, a series of substitution operations are performed, which consist of bitwise XOR operations employing a pre-established substitution box (S), bitwise calculations, and intricate bit-level manipulations. The encrypted Image 1s then reshaped back into its original 2D matrix form. Reverse circular shifting operations are performed on the bitplanes of the image, driven by modular calculations derived from predetermined values. The original bitplanes are reconstructed through a reverse block-wise XOR operation that utilizes specific bitplanes and their relevant elements from the encryption hash (H). Decrypted Image variable P is ultimately produced by combining the reconstructed bitplanes. The intricate decryption process highlights the complexity and resilience of the proposed encryption scheme.

    In this section, we have conducted many standard analyses to evaluate the reliability of the suggested encryption technique.

    The Majority Logic Criterion (MLC) [55] is a comprehensive framework consisting of contrast, energy, correlation, and homogeneity analyses. Its primary objective is the meticulous examination of the statistical properties inherent in image encryption algorithms.

    The degree of contrast within an image plays a crucial role During the image processing procedure, alterations are made to ensure optimum contrast and luminance viewing conditions. Contrast refers to the difference in luminance between objects within an image. The encryption procedure incorporates a non-linear S-box replacement, which establishes a connection between visual contrast and randomness. A standard unaltered image has very little contrast. The calculation of image contrast is determined by utilizing this formula:

    C=m1,n1j,k=0p(j,k)|kj|2. (6.1)

    In this equation, p(j,k) represents the location of pixels in gray level co-occurrence matrices. Table 4 presents the contrast values for all nine images. The encrypted images show significantly greater contrast ratings than the original ones. This significant difference demonstrates that the proposed encryption technique effectively minimizes disclosure of data.

    Table 4.  Results of MLC.
    Images Contrast Correlation Energy Homogeneity
    Med-Image 1-Org 0.3607 0.9551 0.2086 0.9009
    Med-Image 1-Enc 10.6963 -0.01783 0.0159 0.3889
    Med-Image 1-Enc [56] 10.1802 0.00913 0.0334 0.4012
    Med-Image 1-Enc [57] 10.0216 0.03001 0.0167 0.3916
    Med-Image 1-Enc [58] 10.5286 0.00062 0.0194 0.4012
    Med-Image 1-Enc [59] 10.2129 0.00381 0.0234 0.3930
    Med-Image 2-Org 0.0964 0.9819 0.1944 0.9697
    Med-Image 2-Enc 10.5078 0.00075 0.0156 0.3895
    Med-Image 2-Enc [56] 10.2390 0.00093 0.0201 0.3898
    Med-Image 2-Enc [57] 10.1904 0.00298 0.0177 0.3909
    Med-Image 2-Enc [58] 10.3491 0.00081 0.0161 0.3891
    Med-Image 2-Enc [59] 10.2145 0.00119 0.0209 0.3925
    Med-Image 3-Org 0.0914 0.9503 0.2764 0.9617
    Med-Image 3-Enc 10.5208 -0.00112 0.0156 0.3894
    Med-Image 3-Enc [56] 10.4376 0.00121 0.0167 0.3912
    Med-Image 3-Enc [57] 10.1903 0.00092 0.0183 0.3904
    Med-Image 3-Enc [58] 10.2693 0.00032 0.0180 0.3944
    Med-Image 3-Enc [59] 10.0061 0.00120 0.0163 0.4012
    Med-Image 4 Org 0.2256 0.9776 0.4199 0.9405
    Med-Image 4-Enc 10.4705 0.00101 0.0156 0.3891
    Med-Image 4-Enc [56] 10.1283 0.00129 0.0159 0.3936
    Med-Image 4-Enc [57] 10.1179 0.00213 0.0161 0.3962
    Med-Image 4-Enc [58] 10.3810 0.00173 0.0188 0.4045
    Med-Image 4-Enc [59] 10.2940 0.00122 0.0173 0.3981
    Med-Image 5-Org 0.35963 0.9208 0.1981 0.9413
    Med-Image 5-Enc 10.4583 0.00073 0.0156 0.3903
    Med-Image 5-Enc [56] 10.2316 0.00214 0.0167 0.3956
    Med-Image 5-Enc [57] 10.1132 0.00195 0.0179 0.3972
    Med-Image 5-Enc [58] 10.3350 0.00094 0.0163 0.3982
    Med-Image 5-Enc [59] 10.1543 0.00186 0.0193 0.3976
    Med-Image 6-Org 0.2844 0.9394 0.3344 0.9188
    Med-Image 6-Enc 10.5157 0.00062 0.0156 0.3898
    Med-Image 6-Enc [56] 10.1756 0.00109 0.0160 0.3987
    Med-Image 6-Enc [57] 10.1382 0.00154 0.0195 0.4012
    Med-Image 6-Enc [58] 10.3902 0.00071 0.0185 0.3917
    Med-Image 6-Enc [59] 10.0185 0.00105 0.0176 0.4018
    Lena Image-Org 0.4482 0.9024 0.1127 0.8622
    Lena Image-Enc 10.4967 0.0011 0.0156 0.3899
    Lena Image -Enc [56] 10.2814 0.0012 0.0163 0.4012
    Lena Image-Enc [57] 10.2484 0.0014 0.0185 0.4083
    Lena Image-Enc [58] 10.4129 0.0015 0.0191 0.3943
    Lena Image-Enc [59] 10.3270 0.0017 0.0187 0.3982
    Barabara Image-Org 1.0456 0.8246 0.0643 0.7695
    Barabara Image-Enc 10.4456 0.0049 0.0156 0.3921
    Barabara Image -Enc [56] 10.3184 0.0068 0.0166 0.3938
    Barabara Image-Enc [57] 10.4290 0.0109 0.0182 0.3973
    Barabara Image-Enc [58] 10.2283 0.0101 0.0174 0.4019
    Barabara Image-Enc [59] 10.1840 0.0083 0.0162 0.3956
    Tree Image-Org 0.3861 0.9572 0.1298 0.8697
    Tree Image-Enc 10.5320 0.0010 0.0156 0.3904
    Tree Image -Enc [56] 10.3754 0.0017 0.0174 0.3974
    Tree Image-Enc [57] 10.2185 0.0034 0.0180 0.4095
    Tree Image-Enc [58] 10.4493 0.0019 0.0159 0.4067
    Tree Image-Enc [59] 10.5038 0.0071 0.0193 0.3949

     | Show Table
    DownLoad: CSV

    In energy analysis, the sum of squared gray level co-occurrence components is determined. The gray level co-occurrence matrix reveals that in a plain image, pixels with high values tend to cluster in specific regions, resulting in a higher energy value. The energy of the encoded Image 1s lower compared to the original image due to the distribution of energy values in the encoded image. The subsequent equation can be employed to compute it.

    E=j,kp(j,k)2. (6.2)

    The correlation test is a widely utilized methodology for quantifying the resemblance between a plain image and its encrypted counterpart. It entails the examination of pixel values in the original image and their comparison with the corresponding values in the encrypted image. It serves as a metric for assessing the degree of association between neighboring pixel values in the two images. A lesser correlation value of the encrypted image confirms that it has been distorted more during encryption.

    Homogeneity is utilized as a quantitative measure to evaluate the proximity between the distributions of elements in the gray level co-occurrence matrix's diagonal and the gray level co-occurrence itself. This assessment involves the application of a mathematical procedure. The range of homogeneity lies in [0,1], with the diagonal components of the gray level co-occurrence matrix determining its magnitude. Small homogeneity scores in encryption signify a stronger algorithm. The following equation is utilized to calculate homogeneity:

    H=j,kp(j,k)1+|kj|. (6.3)

    The results of the MCL are shown in Table 4. The results demonstrate unequivocally that the proposed image encryption scheme is secure.

    By means of entropy assessment, the degree of randomness of an encrypted Image 1s quantified. The mathematical formulation of entropy is as follows:

    E=M1j=1Q(Xj)log2Q(Xj), (6.4)

    where Q(Xj) represents the likelihood that the given symbol (Xj) will be present. The gray value distribution of pixels is more uniform with more entropy. Predictability could compromise image security if encrypted image entropy is much less than 8.

    Table 5.  Results of information entropy analysis.
    Images Information Entropy Value
    Med-Image 1-Org 5.538845468845064
    Med-Image 1-Enc 7.995592352604773
    Med-Image 2-Org 6.441629371127330
    Med-Image 2-Enc 7.998595551509233
    Med-Image 3-Org 6.528148444114600
    Med-Image 3-Enc 7.999155836842628
    Med-Image 4 Org 4.665262340281411
    Med-Image 4-Enc 7.992226449459711
    Med-Image 5-Org 7.178730739603131
    Med-Image 5-Enc 7.999264746215498
    Med-Image 6-Org 6.276306307901546
    Med-Image 6-Enc 7.999096158086002
    Lena Image-Org 7.443921390749898
    Lena Image-Enc 7.997093894234909
    Barabara Image-Org 7.630961729011966
    Barabara Image-Enc 7.997428353585646
    Tree Image-Org 7.310272448303230
    Tree Image-Enc 7.997342743277636

     | Show Table
    DownLoad: CSV

    Two most common criteria, number of pixel change rate (NPCR) and unified average changing intensity (UACI), are used to quantitatively measure the influence of one pixel change on the encrypted image. Between the two encrypted images, the percentage of different pixel numbers is measured by NPCR and the average intensity of differences is measured by UACI. Let the difference in pixel of two original images is only one and their corresponding encrypted images are denoted by C1(i,j) and C2(i,j). The values of NPCR and UACI are calculated using the following formulas:

    NCPR=1M×NMi=1Nj=1D(i,j)×100% (6.5)
    UACI=1M×NMi=1Nj=1|C1(i,j)C2(i,j)|255×100%, (6.6)

    where D(i,j) is zero if C1(i,j) and C2(i,j) are the same otherwise it is equal to one. Furthermore, M and N represent the image width and image height, respectively. Table 6 presents a comprehensive analysis of the UACI and NPCR metrics indicating the effectiveness and quality of the proposed image encryption scheme.

    Table 6.  UACI and NPCR scores of all selected images.
    Image NCPR % UACI %
    Med-Image 1 99.618911743164063 33.417216282264860
    Med-Image 2 99.628511372472786 33.505320066401367
    Med-Image 3 99.592464826839830 33.440731169361683
    Med-Image 4 99.657004888803684 33.486923718874053
    Med-Image 5 99.608993530273438 33.334975897097117
    Med-Image 6 99.582672119140625 33.547846476236977
    Lena 99.5926 33.5699
    Barabara 99.5789 33.3566
    Tree 99.6170 33.3972

     | Show Table
    DownLoad: CSV

    Histograms are representations of the distribution of pixel gray level intensities in an image. A cryptanalyst may utilize the information provided to perform histogram attacks if the distribution has a non-uniform nature. However, the approach has been designed to be resistant to histogram attacks, and information is unidentified if the histogram is uniform and flattened. By analyzing the histograms of both the encrypted and original images, we can observe the differences in color intensities between them. We conducted tests on the histograms of the original and encrypted images and found that the histogram distribution of the encrypted image, generated using the proposed S-box, significantly deviates from that of the original image. In Figure 3, histograms of the original and encrypted images of all nine images, chosen for encryption, are shown. The histogram of the encrypted image appears to be quite uniform, confirming the efficiency of the proposed mechanism. The correlation plots for vertical, horizontal and diagonal neighboring pixels in original and encrypted images are shown in Figure 4. This result indicates that it is exceedingly challenging to exploit the statistical characteristics of the encrypted image to reconstruct the original image.

    Figure 3.  Histogram analysis.
    Figure 4.  Pixel correlation plots.

    In this section, the effectiveness of the presented encryption algorithm is evaluated experimentally. The nine original multiple images, as well as each of their encrypted counterparts, are analyzed here. These ciphered images were produced following the proposed encryption algorithm. The purpose is to evaluate the robustness and dependability of the proposed encryption technique.

    The MSE is used to determine the cumulative squared difference between plain image and cipher image [60]. The statistical formula used to calculate MSE is given below:

    MSE=1M×NMj=1Ni=1(α(i,j)β(i,j))2, (6.7)

    where α(i,j) is the original image and β(i,j) is the encrypted image. Moreover, M and N represent the image width and image height, respectively.

    This criterion [61] provides the discrepancy between the original and encoded images. In order to determine its value, the following relation is applied:

    RMSE=1M×NMj=1Ni=1(α(i,j)β(i,j))2. (6.8)

    The peak signal-to-noise ratio, abbreviated PSNR [62], is the metric used to determine the fidelity of the encrypted image. The formulas listed below define PSNR:

    PSNR=10log2(Y2maxMSE), (6.9)

    where Ymax is the highest possible pixel value in the image.

    Researchers utilized the MD and AD test [62] to calculate the maximum and mean variations between the original α(i,j) and concealed β(i,j) images. Formulas for calculating MD and AD scores are as follows:

    MD=max|α(i,j)β(i,j)| (6.10)
    AD=1M×NMj=1Ni=1|α(i,j)β(i,j)|. (6.11)

    According to [63], MI quantifies the quantity of original image data that can be reconstructed from the encrypted version. Applying the following formula, the value of MI can be calculated:

    MI=iαjβρ(i,j)log2ρ(i,j)ρ(i)ρ(j). (6.12)

    Here ρ(i,j) represents joint probability function of α and β.

    According to reference [63], the UQI technique breaks down assessments of picture distortion into three distinct categories: Brightness, structural similarity, and contrast. In order to determine the value of the UQI, the following statistical equation is used.

    UQI=4ραρβραβ(ρ2αρ2β)(2α2β). (6.13)

    The symbols ρα and ρβ represent the mean scores of the actual and altered images, respectively. In a similar way, α and β represent the standard deviation of the source and altered images, respectively.

    SSIM [63] is a refined variant of the UQI that is used to determine how similar the two images are to one another. For this purpose, SSIM assumes that the other Image 1s error-free before evaluating the precision of the first image. The SSIM score is calculated by applying the following equation to an image's (R,S)window pairs:

    SSIM=(2θRθS+b1)(2πRπS+b2)(θ2R+θ2S+b1)(π2R+π2S+b2), (6.14)

    where πR and πS are the standard deviations of R and S, whereas θR and θS are the means of R and S. The possible value range of the SSIM index is [-1, 1]. When the two images are alike, the SSIM=1.

    According to [64], the resemblance between both images is derived through the use of the correlation function. NCC finds the relationship between the initial and ciphered images. NCC is determined by the following equation:

    NCC=Mj=1Ni=1(α(i,j)×β(i,j)Mj=1Ni=1|α(i,j)|2). (6.15)

    The NAE [60] is utilized to evaluate the effectiveness of an image encryption procedure by assessing each of the pixels in the initial image and those in the scrambled image. To determine the NAE between both images (unencrypted and encrypted), the following formula is used:

    NAE=Mj=1Ni=1|α(i,j)β(i,j)|Mj=1Ni=1α(i,j). (6.16)

    The connection between both images (plain and ciphered) is analyzed using SC, which is a correlation-based metric. The score of SC [64] is calculated using the following formula:

    SC=Mj=1Ni=1|α(i,j)|2Mj=1Ni=1|β(i,j)|2. (6.17)

    Table 7 presents a comprehensive analysis of the aforementioned image quality metrics.

    Table 7.  Results of different image quality metrics.
    Images MSE RMSC PSNR MD AD MI UQI SSIM NCC NAE SC
    Med- Image 1 13728 117.1696 27.4426 255.0 -57.5962 -1.01389 0.0054 -0.000049 0.9030 1.3832 0.4538
    Med- Image 2 11149 105.5917 27.8945 253.0 -48.3941 -1.0077 0.0021 -0.000096 1.0517 1.0906 0.4407
    Med- Image 3 8964 94.6823 26.0824 180.0 -51.1355 -1.0093 0.0012 -0.000064 1.4499 1.0203 0.3084
    Med- Image 4 17077 130.6791 26.9687 255.0 -73.6196 -1.0127 0.0016 -0.000043 0.7550 2.0285 0.4189
    Med- Image 5 12124 110.1127 27.7124 255.0 -64.3602 -1.0102 0.0009 -0.000085 1.2329 1.4249 0.3011
    Med- Image 6 15057 122.7096 27.2420 255.0 -83.8400 -1.0132 0.0003 0.000195 1.2466 2.3282 0.2051
    Lena Image 7777 88.1901 28.2221 230.0 -2.6871 -1.0415 0.0595 0.000502 0.8890 0.5890 0.8211
    Barabara Image 8529 92.3570 28.1286 237.0 -9.9577 -1.0415 0.0175 0.000251 0.8919 0.6479 0.7732
    Tree Image 10001 100.0072 27.4946 232.0 1.5429 -1.0420 -0.2945 -0.000455 0.7770 0.6322 0.9755

     | Show Table
    DownLoad: CSV

    The NIST STS800 test suite is applicable for the first six images shown in Figure 2. The reason being that all six images have number bits higher than 106, and the NIST tool has the prerequisite, is that the candidate sequence under examination for the randomness test should have at least 106 bits, whereas the size of the other 3 benchmark images is 256×256, the total bits are less than 106. The outcomes of these analysis are given in Table 8.

    Table 8.  Outcomes of NIST Test.
    Test type Image-1 Image-2 Image-3 Image-4 Image-5 Image-6
    Monobit Test 0.43903 0.47770 0.35340 0.69731 0.88392 0.77641
    Block Frequency Test 0.99997 0.14594 0.96356 0.82187 0.40998 0.08800
    Runs Test 0.47271 0.58403 0.38273 0.23048 0.88078 0.13415
    Longest Runs Test 0.18970 0.45625 0.07606 0.16298 0.18540 0.21418
    Rank Test 0.43982 0.55657 0.94818 1.4328e-10 0.42273 0.88511
    DFT Test 0.50274 0.11032 0.56317 0.39283 0.34926 0.60732
    Non-Overlap Template 0.12903 0.04168 0.21012 0.001338 0.80155 0.04310
    Overlapping Template 0.075307 0.00450 0.60909 0.002588 0.79531 0.57313
    Maurer's Universal 0.70728 0.49828 0.89436 0.068614 0.75774 0.56219
    Linear Complexity Test 0.90873 0.25357 0.79977 0.967248 0.45090 0.63855
    Serial Test 0.29041 0.42942 0.34673 0.48921 0.08615 0.013220
    ApEn Entropy 0.84024 0.42091 0.08957 0.76294 0.21730 0.91937
    Cumulative Sums 0.00123 0.82715 0.44668 0.46938 0.52637 0.53563
    Excursion Test 0.58931 0.26336 0.26599 0.29880 0.33396 0.34847
    Random Excursion Variant 0.76302 0.53474 0.88917 0.55629 0.43098 0.67804

     | Show Table
    DownLoad: CSV

    This research presents a significant contribution to the field of medical image encryption by introducing a novel algorithm that addresses the security requirements of e-Healthcare systems. A novel methodology is developed to generate substitution-boxes through the combination of a multiplicative cyclic group and a permutation group. To assess the efficacy of the suggested S-box, several benchmark algebraic parameters are performed. The outcomes obtained from these assessment mechanisms provide evidence for the reliability and robustness of the proposed S-box in mitigating numerous attacks. An algorithm for robust medical image encryption is devised that is based on the generated substitution box. In order to evaluate the quality of the encryption scheme, benchmark assessments that are specifically tailored for image encryption techniques are employed. The outcomes demonstrate that the proposed encryption method can successfully encrypt medical images. In the future, we plan on using these resilient S-boxes, created by the suggested approach, in multimedia security applications beyond only image encryption. This includes video and audio steganography as well as watermarking.

    The authors declare that they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors declare no conflicts of interest.



    [1] A. Biswas, Optical soliton perturbation with Radhakrishnan-Kundu-Lakshmanan equation by traveling wave hypothesis, Optik, 171 (2018), 217–220. https://doi.org/10.1016/j.ijleo.2018.06.043 doi: 10.1016/j.ijleo.2018.06.043
    [2] A. Biswas, A. J. M. Jawad, Q. Zhou, Resonant optical solitons with anti-cubic nonlinearity, Optik, 157 (2018), 525–531. https://doi.org/10.1016/j.ijleo.2017.11.125 doi: 10.1016/j.ijleo.2017.11.125
    [3] S. Arshed, Two reliable techniques for the soliton solutions of perturbed Gerdjikov-Ivanov equation, Optik, 164 (2018), 93–99. https://doi.org/10.1016/j.ijleo.2018.02.119 doi: 10.1016/j.ijleo.2018.02.119
    [4] M. S. Osman, Nonlinear interaction of solitary waves described by multi-rational wave solutions of the (2+1)-dimensional Kadomtsev-Petviashvili equation with variable coefficients, Nonlinear Dyn., 87 (2017), 1209–1216. https://doi.org/10.1007/s11071-016-3110-9 doi: 10.1007/s11071-016-3110-9
    [5] F. Tahir, M. Younis, H. U. Rehman, Optical Gaussons and dark solitons in directional couplers with spatiotemporal dispersion, Opt. Quant. Electron., 50 (2018), 422. https://doi.org/10.1007/s11082-017-1259-1 doi: 10.1007/s11082-017-1259-1
    [6] N. Ullah, H. Rehman, M. A. Imran, T. Abdeljawad, Highly dispersive optical solitons with cubic law and cubic-quintic-septic law nonlinearities, Results Phys., 17 (2020), 103021. https://doi.org/10.1016/j.rinp.2020.103021 doi: 10.1016/j.rinp.2020.103021
    [7] Y. Ren, H. Zhang, New generalized hyperbolic functions and auto-Backlund transformations to find new exact solutions of the (2+1)-dimensional NNV equation, Phys. Lett. A, 357 (2006), 438–448. https://doi.org/10.1016/j.physleta.2006.04.082 doi: 10.1016/j.physleta.2006.04.082
    [8] H. Rezazadeh, S. M. Mirhosseini-Alizamini, M. Eslami, M. Rezazadeh, M. Mirzazadeh, S. Abbagari, New optical solitons of nonlinear conformable fractional Schrodinger-Hirota equation, Optik, 172 (2018), 545–553. https://doi.org/10.1016/j.ijleo.2018.06.111 doi: 10.1016/j.ijleo.2018.06.111
    [9] M. Quiroga-Teixeiro, H. Michinel, Stable azimuthal stationary state in quintic nonlinear optical media, J. Opt. Soc. Am. B, 14 (1997), 2004–2009. https://doi.org/10.1364/JOSAB.14.002004 doi: 10.1364/JOSAB.14.002004
    [10] H. U. Rehman, N. Ullah, M. A. Imran, Highly dispersive optical solitons using Kudryashov's method, Optik, 199 (2019), 163349. https://doi.org/10.1016/j.ijleo.2019.163349 doi: 10.1016/j.ijleo.2019.163349
    [11] H. U. Rehman, S. Jafar, A. Javed, S. Hussain, M. Tahir, New optical soliotons of Biswas-Arshed equation using different technique, Optik, 206 (2020), 163670. https://doi.org/10.1016/j.ijleo.2019.163670 doi: 10.1016/j.ijleo.2019.163670
    [12] M. Tahir, A. U. Awan, H. U. Rehman, Dark and singular optical solitons to the Biswas-Arshed model with Kerr and power law nonlinearity, Optik, 185 (2019), 777–783. https://doi.org/10.1016/j.ijleo.2019.03.108 doi: 10.1016/j.ijleo.2019.03.108
    [13] P. K. Das, Chirped and chirp-free optical exact solutions of the Biswas-Arshed equation with full nonlinearity by the rapidly convergent approximation method, Optik, 223 (2020), 165293. https://doi.org/10.1016/j.ijleo.2020.165293 doi: 10.1016/j.ijleo.2020.165293
    [14] Z. Korpinar, M. Inc, M. Bayram, M. S. Hashemi, New optical solitons for Biswas-Arshed equation with higher order dispersions and full nonlinearity, Optik, 206 (2020), 163332. https://doi.org/10.1016/j.ijleo.2019.163332 doi: 10.1016/j.ijleo.2019.163332
    [15] M. Tahir, A. U. Awan, Optical singular and dark solitons with Biswas-Arshed model by modified simple equation method, Optik, 202 (2020), 163523. https://doi.org/10.1016/j.ijleo.2019.163523 doi: 10.1016/j.ijleo.2019.163523
    [16] M. Ekici, A. Sonmezoglu, Optical solitons with Biswas-Arshed equation by extended trial function method, Optik, 177 (2019), 13–20. https://doi.org/10.1016/j.ijleo.2018.09.134 doi: 10.1016/j.ijleo.2018.09.134
    [17] B. Karaagac, New exact solutions for some fractional order differential equations via improved sub-equation method, Discret Cont. Dyn. S, 12 (2019), 447–54. https://doi.org/10.3934/dcdss.2019029 doi: 10.3934/dcdss.2019029
    [18] M. Alam, F. Belgacem, Microtubules nonlinear models dynamics investigations through the exp(G(G))-expansion method implementation, Mathematics, 4 (2016), 6. https://doi.org/10.3390/math4010006 doi: 10.3390/math4010006
    [19] A. Sonmezoglu, Exact solutions for some fractional differential equations, Adv. Math. Phys., 2015 (2015), 567842. https://doi.org/10.1155/2015/567842 doi: 10.1155/2015/567842
    [20] R. Saleh, M. Kassem, S. M. Mabrouk, Exact solutions of nonlinear fractional order partial differential equations via singular manifold method, Chinese J. Phys., 61 (2019), 290–300. https://doi.org/10.1016/j.cjph.2019.09.005 doi: 10.1016/j.cjph.2019.09.005
    [21] M. Iqbal, A. R. Seadawy, D. Lu, Construction of solitary wave solutions to the nonlinear modified Kortewegede Vries dynamical equation in unmagnetized plasma via mathematical methods, Mod. Phys. Lett. A, 33 (2018), 1850183. https://doi.org/10.1142/S0217732318501833 doi: 10.1142/S0217732318501833
    [22] M. N. Alam, C. Tunc, Constructions of the optical solitons and others soliton to the conformable fractional zakharov-kuznetsov equation with power law nonlinearity, J. Taibah Univ. Sci., 14 (2020), 94–100. https://doi.org/10.1080/16583655.2019.1708542 doi: 10.1080/16583655.2019.1708542
    [23] N. Kadkhoda, H. Jafari, An analytical approach to obtain exact solutions of some space-time conformable fractional differential equations, Adv. Differ. Equ., 2019 (2019), 428. https://doi.org/10.1186/s13662-019-2349-0 doi: 10.1186/s13662-019-2349-0
    [24] A. R. Seadawy, Three-dimensional weakly nonlinear shallow water waves regime and its travelling wave solutions, Int. J. Comp. Meth., 15 (2018), 1850017. https://doi.org/10.1142/S0219876218500172 doi: 10.1142/S0219876218500172
    [25] S. Tian, J. M. Tu, T. T. Zhang, Y. R. Chen, Integrable discretizations and soliton solutions of an Eckhaus-Kundu equation, Appl. Math. Lett., 122 (2021), 107507. https://doi.org/10.1016/j.aml.2021.107507 doi: 10.1016/j.aml.2021.107507
    [26] S. Tian, M. J. Xu, T. T. Zhang, A symmetry-preserving difference scheme and analytical solutions of a generalized higher-order beam equation, P. Roy. Soc. A, 477 (2021), 20210455. https://doi.org/10.1098/rspa.2021.0455
    [27] S. Tian, Lie symmetry analysis, conservation laws and solitary wave solutions to a fourth-order nonlinear generalized Boussinesq water wave equation, Appl. Math. Lett., 100 (2020), 106056. https://doi.org/10.1016/j.aml.2019.106056 doi: 10.1016/j.aml.2019.106056
    [28] S. Tian, D. Guo, X. Wang, T. Zhang, Traveling wave, lump Wave, rogue wave, multi-kink solitary wave and interaction solutions in a (3+1)-dimensional Kadomtsev-Petviashvili equation with Backlund transformation, J. Appl. Anal. Comput., 11 (2021), 45–58. https://doi.org/10.11948/20190086 doi: 10.11948/20190086
    [29] B. Q. Li, Optical rogue wave structures and phase transitions in a light guide fiber system doped with two-level resonant atoms, Optik, 253 (2022), 168541. https://doi.org/10.1016/j.ijleo.2021.168541 doi: 10.1016/j.ijleo.2021.168541
    [30] B. Q. Li, Y. L. Ma, Interaction properties between rogue wave and breathers to the manakov system arising from stationary self-focusing electromagnetic systems, Chaos Soliton. Fract., 156 (2022), 111832. https://doi.org/10.1016/j.chaos.2022.111832 doi: 10.1016/j.chaos.2022.111832
    [31] B. Q. Li, Interaction behaviors between breather and rogue wave in a Heisenberg ferromagnetic equation, Optik, 227 (2020), 166101. https://doi.org/10.1016/j.ijleo.2020.166101 doi: 10.1016/j.ijleo.2020.166101
    [32] B. Q. Li, Y. L. Ma, Interaction dynamics of hybrid solitons and breathers for extended generalization of Vakhnenko equation, Nonlinear Dyn., 102 (2020), 1787–1799. https://doi.org/10.1007/s11071-020-06024-4 doi: 10.1007/s11071-020-06024-4
    [33] B. Q. Li, Y. L. Ma, N-order rogue waves and their novel colliding dynamics for a transient stimulated Raman scattering system arising from nonlinear optics, Nonlinear Dyn., 101 (2020), 2449–2461. https://doi.org/10.1007/s11071-020-05906-x doi: 10.1007/s11071-020-05906-x
    [34] Y. Shang, The extended hyperbolic function method and exact solutions of the long-short wave resonance equations, Chaos Soliton. Fract., 36 (2008), 762–771. https://doi.org/10.1016/j.chaos.2006.07.007 doi: 10.1016/j.chaos.2006.07.007
    [35] Y. Shang, Y. Huang, W. Yuan, The extended hyperbolic functions method and new exact solutions to the Zakharov equations, Appl. Math. Comput., 200 (2008), 110–122. https://doi.org/10.1016/j.amc.2007.10.059 doi: 10.1016/j.amc.2007.10.059
    [36] S. Nestor, A. Houwe, G. Betchewe, M. Inc, S. Y. Doka, A series of abundant new optical solitons to the conformable space-time fractional perturbed nonlinear Schrödinger equation, Phys. Scr., 95 (2020), 085108. https://doi.org/10.1088/1402-4896/ab9dad doi: 10.1088/1402-4896/ab9dad
    [37] K. S. Nisar, A. Ahmad, M. Inc, M. Farman, H. Rezazadeh, L. Akinyemi, et al., Analysis of dengue transmission using fractional order scheme, AIMS Math., 7 (2022), 8408–8429. https://doi.org/10.3934/math.2022469 doi: 10.3934/math.2022469
    [38] M. S. Hashemi, H. Rezazadeh, H. Almusawa, H. Ahmad, A Lie group integrator to solve the hydromagnetic stagnation point flow of a second grade fluid over a stretching sheet, AIMS Math., 6 (2021), 13392–13406. https://doi.org/10.3934/math.2021775 doi: 10.3934/math.2021775
    [39] M. X. Zhou, A. S. V. Ravi Kanth, K. Aruna, K. Raghavendar, H. Rezazadeh, M. Inc, et al., Numerical solutions of time fractional Zakharov-Kuznetsov equation via natural transform decomposition method with nonsingular kernel derivatives, J. Funct. Space., 2021 (2021), 9884027. https://doi.org/10.1155/2021/9884027 doi: 10.1155/2021/9884027
  • This article has been cited by:

    1. Aqsa Zafar Abbasi, Ayesha Rafiq, Lioua Kolsi, Parametrization of generalized triangle groups and construction of substitution-box for medical image encryption, 2024, 36, 13191578, 102159, 10.1016/j.jksuci.2024.102159
    2. José Ricardo Cárdenas-Valdez, Ramón Ramírez-Villalobos, Catherine Ramirez-Ubieta, Everardo Inzunza-Gonzalez, Enhancing Security of Telemedicine Data: A Multi-Scroll Chaotic System for ECG Signal Encryption and RF Transmission, 2024, 26, 1099-4300, 787, 10.3390/e26090787
    3. Jianwu Xu, Kun Liu, Qingye Huang, Quanjun Li, Linqing Huang, A plaintext-related and ciphertext feedback mechanism for medical image encryption based on a new one-dimensional chaotic system, 2024, 99, 0031-8949, 125220, 10.1088/1402-4896/ad8bfc
    4. A. Hadj Brahim, H. Ali Pacha, M. Naim, A. Ali Pacha, A novel pseudo-random number generator: combining hyperchaotic system and DES algorithm for secure applications, 2025, 81, 0920-8542, 10.1007/s11227-024-06639-z
    5. Yilmaz Aydin, Ali Murat Garipcan, Fatih Özkaynak, A Novel Secure S-box Design Methodology Based on FPGA and SHA-256 Hash Algorithm for Block Cipher Algorithms, 2024, 2193-567X, 10.1007/s13369-024-09251-8
    6. Abdul Razaq, Muhammad Mahboob Ahsan, Hanan Alolaiyan, Musheer Ahmad, Qin Xin, Enhancing the robustness of block ciphers through a graphical S-box evolution scheme for secure multimedia applications, 2024, 9, 2473-6988, 35377, 10.3934/math.20241681
    7. Amal S. Alali, Rashad Ali, Muhammad Kamran Jamil, Javed Ali, , Secure medical image encryption with hyperelliptic curve based S-boxes, 2025, 15, 2045-2322, 10.1038/s41598-025-02102-y
    8. Muhammad Umair Safdar, Tariq Shah, Asif Ali, The class of bivariate non-chain rings and its application to data security, 2025, 28, 1386-7857, 10.1007/s10586-024-05030-0
  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1810) PDF downloads(72) Cited by(5)

Figures and Tables

Figures(6)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog