<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">IASC</journal-id>
<journal-id journal-id-type="nlm-ta">IASC</journal-id>
<journal-id journal-id-type="publisher-id">IASC</journal-id>
<journal-title-group>
<journal-title>Intelligent Automation &#x0026; Soft Computing</journal-title>
</journal-title-group>
<issn pub-type="epub">2326-005X</issn>
<issn pub-type="ppub">1079-8587</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">31855</article-id>
<article-id pub-id-type="doi">10.32604/iasc.2023.031855</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Classification of Nonlinear Confusion Component Using Hybrid Multi-Criteria Decision Making</article-title><alt-title alt-title-type="left-running-head">Classification of Nonlinear Confusion Component Using Hybrid Multi-Criteria Decision Making</alt-title><alt-title alt-title-type="right-running-head">Classification of Nonlinear Confusion Component Using Hybrid Multi-Criteria Decision Making</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Abughazalah</surname><given-names>Nabilah</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Ishaque</surname><given-names>Iqra</given-names></name>
<xref ref-type="aff" rid="aff-2">2</xref>
</contrib>
<contrib id="author-3" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Khan</surname><given-names>Majid</given-names></name>
<xref ref-type="aff" rid="aff-2">2</xref><email>mk.cfd1@gmail.com</email>
</contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Alanazi</surname><given-names>Ammar S.</given-names></name>
<xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Hussain</surname><given-names>Iqtadar</given-names></name>
<xref ref-type="aff" rid="aff-4">4</xref>
<xref ref-type="aff" rid="aff-5">5</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>Department of Mathematical Sciences, College of Science, Princess Nourah bint Abdulrahman University</institution>, <addr-line>P.O.Box 84428, Riyadh 11671</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Applied Mathematics and Statistics, Institute of Space Technology</institution>, <addr-line>Islamabad</addr-line>, <country>Pakistan</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Mathematics, King Abdulaziz University, Faculty of Science</institution>, <addr-line>Jeddah</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-4"><label>4</label><institution>Mathematics Program, Department of Mathematics, Statistics and Physics, College of Arts and Sciences, Qatar University</institution>, <addr-line>2713, Doha</addr-line>, <country>Qatar</country></aff>
<aff id="aff-5"><label>5</label><institution>Statistical Consulting Unit, College of Arts and Science, Qatar University</institution>, <addr-line>Doha</addr-line>, <country>Qatar</country></aff>
</contrib-group><author-notes><corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Majid Khan. Email: <email>mk.cfd1@gmail.com</email></corresp></author-notes>
<pub-date publication-format="print" date-type="pub" iso-8601-date="2022-12-17"><day>17</day><month>12</month><year>2022</year></pub-date>
<volume>36</volume>
<issue>2</issue>
<fpage>1451</fpage>
<lpage>1463</lpage>
<history>
<date date-type="received"><day>28</day><month>4</month><year>2022</year></date>
<date date-type="accepted"><day>29</day><month>6</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Abughazalah et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Abughazalah et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_IASC_31855.pdf"></self-uri>
<abstract>
<p>In today&#x2019;s digital world, the most inevitable challenge is the protection of digital information. Due to the weak confidentiality preserving techniques, the existing world is facing several digital information breaches. To make our digital data indecipherable to the unauthorized person, a technique for finding a cryptographically strong Substitution box (S-box) have presented. An S-box with sound cryptographic assets such as nonlinearity (NL), strict avalanche criterion (SAC), bit independence criteria (BIC), bit independence criteria of nonlinearity (BIC-NL), Bit independence criteria of Strict avalanche criteria (BIC-SAC), and Input/output XOR is considered as the robust S-box. The Decision-Making Trial and Evaluation Laboratory (DEMATEL) approach of multi-criteria decision making (MCDM) is proposed for finding the interrelation among cryptographic properties. A combination of two MCDM methods namely Entropy and multi-objective optimization based on ratio analysis (MOORA) is applied for the best S-box selection. A robust substitution box is selected for secure communications in cryptography by using the combination of DEMETAL selection criteria, entropy weight assigning, and MOORA ranking scheme. The combination of these three methods provides a fast selection procedure for the secure confusion component. The offered selection method can also be utilized for the choice of the best cryptosystem with highly secure properties and resistive against all possible linear and differential attacks in the cryptanalysis.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>DEMATEL</kwd>
<kwd>MCDM</kwd>
<kwd>MOORA</kwd>
<kwd>nonlinearity</kwd>
<kwd>S-box</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Communication over public channels is becoming increasingly common, implying that approved access is required. The rapid development of multimedia technology, as well as digital content such as photographs, video, and audio, has a significant impact on communication. Since information is conveyed from one end to the other in these advanced communication methods [<xref ref-type="bibr" rid="ref-1">1</xref>]. As a result, the protection of this digital data is an unavoidable concern. To meet the privacy requirements of such contents, appropriate protection tools must be established [<xref ref-type="bibr" rid="ref-2">2</xref>]. Classified information can be kept confidential using a variety of security measures. These systems used encryption, which is the method of converting original data into an unreadable format [<xref ref-type="bibr" rid="ref-3">3</xref>]. An S-box is a crucial tool, and it is widely used in the field of cryptography [<xref ref-type="bibr" rid="ref-4">4</xref>]. The S-box is the only non-linear component in an encryption system that provides necessary confusion. The development of powerful encryption systems necessitates the structure of S-boxes with perfect cryptographic properties. Chaotic S-boxes based on time-delay chaotic systems have been proposed by Yuvaz et al. in [<xref ref-type="bibr" rid="ref-5">5</xref>]. In block ciphers, substitution boxes with robust cryptographic properties are commonly used to provide the important property of nonlinearity. They&#x2019;re necessary to fend off common attacks like linear and differential cryptanalysis [<xref ref-type="bibr" rid="ref-6">6</xref>&#x2013;<xref ref-type="bibr" rid="ref-8">8</xref>]. Hussain et al., assembled S-boxes using an algorithm based on linear fractional transform [<xref ref-type="bibr" rid="ref-9">9</xref>&#x2013;<xref ref-type="bibr" rid="ref-11">11</xref>].</p>
<p>Effective decision-making is becoming more desirable as the environment becomes more complex [<xref ref-type="bibr" rid="ref-12">12</xref>]. Decision-makers must always evaluate a dynamic and perplexing situation, determine the cause of a problem, choose an acceptable solution, and implement an effective action plan [<xref ref-type="bibr" rid="ref-13">13</xref>]. Their success is primarily determined by their ability to think objectively about the causal relationship [<xref ref-type="bibr" rid="ref-14">14</xref>].</p>
<p>Multi-criteria decision-making (MCDM) methods offer decision-makers a variety of tools and enable them to decide between multiple conflicting criteria [<xref ref-type="bibr" rid="ref-15">15</xref>]. MCDM methods to real-world decisions, the advancement in technology over the last few decades have allowed for the development of more sophisticated decision analysis methods. There are several approaches available for effective decision-making. Each approach employs numerical techniques to assist decision-makers in selecting from a selection of discrete alternatives [<xref ref-type="bibr" rid="ref-16">16</xref>]. This is accomplished by evaluating the effect of the alternatives on specific parameters and, as a result, the decision maker&#x2019;s overall usefulness [<xref ref-type="bibr" rid="ref-17">17</xref>].</p>
<p>The proposed approach used the DEMATEL method to apply an MCDM model [<xref ref-type="bibr" rid="ref-18">18</xref>]. This method identifies the most suitable alternative in terms of the observed criteria and then compares it to the optimal solution by calculating the distances between other options based on the observed ideal value criterion. The foremost attribute of the DEMATEL method is constructing interrelations among criteria. To discriminate among cause-and-effect groups among different criteria this method provides a way [<xref ref-type="bibr" rid="ref-19">19</xref>&#x2013;<xref ref-type="bibr" rid="ref-21">21</xref>].</p>
<p><xref ref-type="fig" rid="fig-1">Fig. 1</xref> describes a list of several commonly used multi-criteria decision-making approaches to solving different multiple criteria problems in the real world:</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Flow chart of some common MCDM approaches</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_31855-fig-1.png"/>
</fig>
<p>In the present work, an MCDM technique has been employed for finding the best S-box [<xref ref-type="bibr" rid="ref-22">22</xref>]. We have considered some standard S-boxes and a proposed S-box which include AES, Skipjack, Xyi, Residue Prime, and Model 1. The algebraic properties of these S-boxes which we have considered are, Nonlinearity, Strict Avalanche Criteria (SAC), Bit Independence Criteria for Nonlinearity (BIC-NL), Bit Independence Criteria Strict Avalanche Criteria (BIC-SAC), Input/output XOR [<xref ref-type="bibr" rid="ref-23">23</xref>,<xref ref-type="bibr" rid="ref-24">24</xref>]. The Decision-Making Trial and Evaluation Laboratory (DEMATEL) method is used, which is a sort of structural modeling approach, that can separate the involved criteria of a system into the cause group and effect group. Entropy is an objective weighting assigning technique used to assign weights to the criteria and S-boxes are ranked using the MOORA method [<xref ref-type="bibr" rid="ref-25">25</xref>,<xref ref-type="bibr" rid="ref-26">26</xref>]. In any encryption system, S-box is responsible for providing necessary confusion, so we will employ MCDM methods to get the robust S-box.</p>
<p><bold>Research Objectives</bold></p>
<p>The main objectives of this research are as follows:<list list-type="order"><list-item>
<p>To offer a fast selection method using the combination of DEMATEL, entropy, and MOORA methods for decision making, weight assigning, and alternative ranking respectively.</p></list-item><list-item>
<p>To utilize the suggested method for the best selection of confusion components.</p></list-item><list-item>
<p>To increase the speed of selection and choose the best alternative in the minimum time.</p></list-item><list-item>
<p>To get the S-box with high-nonlinearity and other ideal properties.</p></list-item><list-item>
<p>To form a standard method to achieve the ideal selection criteria for other components and cryptosystems in cryptography.</p></list-item></list></p>
<p>The rest of the manuscript is arranged as follows: Section 2 describes some basic assets related to the substitution box, Section 3 includes the basics and mathematical formulation of the DEMATEL method, the entropy method for weight assigning is defined in Section 4, and MOORA scheme for ranking is depicted in Section 5, conclusion and future recommendations are presented in the last section.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Preliminaries</title>
<p>In this segment, we will add some fundamental characteristics of nonlinear confusion components. Our optimum selection of robust nonlinear confusion components is based on these standards and mostly utilized cryptographic properties [<xref ref-type="bibr" rid="ref-1">1</xref>&#x2013;<xref ref-type="bibr" rid="ref-11">11</xref>].</p>
<sec id="s2_1">
<label>2.1</label>
<title>Nonlinearity</title>
<p>Let <inline-formula id="ieqn-1">
<mml:math id="mml-ieqn-1"><mml:msub><mml:mi>N</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:math>
</inline-formula> be a boolean function then nonlinearity can be defined as its lowest possible distance to any affine function. Nonlinearity is calculated as:<disp-formula id="ueqn-1">
<mml:math id="mml-ueqn-1" display="block"><mml:msub><mml:mi>N</mml:mi><mml:mi>h</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mi>W</mml:mi><mml:mi>H</mml:mi><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>h</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:mstyle></mml:math>
</disp-formula>where <inline-formula id="ieqn-2">
<mml:math id="mml-ieqn-2"><mml:mi>W</mml:mi><mml:mi>H</mml:mi><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>h</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>
</inline-formula> represents the Walsh-Hadamard transformation of a Boolean function defined as:<disp-formula id="ueqn-2">
<mml:math id="mml-ueqn-2" display="block"><mml:msub><mml:mrow><mml:mover><mml:mi>F</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>h</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munder><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>B</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:munder><mml:mrow><mml:mrow><mml:mover><mml:mi>h</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>L</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>&#x03B1;</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>where, <inline-formula id="ieqn-3">
<mml:math id="mml-ieqn-3"><mml:mrow><mml:mover><mml:mi>h</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mi>h</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:math>
</inline-formula> is associated characteristic function with Boolean function.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Strict Avalanche Criteria (SAC)</title>
<p>This criterion necessities that for an S-box employed in an encryption scheme if any single information bit <italic>i</italic> is reversed then there exist a likelihood of 50&#x0025; that the output bit <italic>j</italic> is altered <inline-formula id="ieqn-4">
<mml:math id="mml-ieqn-4"><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>j</mml:mi></mml:math>
</inline-formula>. This criterion expands the property of completeness and redefines the criteria of the avalanche. An S-box is said to satisfy the Strict Avalanche Criterion (SAC) if half of its output bit alters whenever there is a variation in an individual input bit. For strict avalanche criteria, an optimum value is 0.5.</p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Bit Independence Criteria for Nonlinearity (BIC-NL)</title>
<p>When a single input bit changes for all <italic>i, j,</italic> and <italic>k</italic> output bits <italic>j,</italic> and <italic>k</italic> must be updated. A highly non-linear Boolean function for two output bits is required to ensure that the correlation between them is zero, as Adam and Tavares pointed out when an input bit was inverted.</p>
</sec>
<sec id="s2_4">
<label>2.4</label>
<title>Bit Independence Criteria of Strict Avalanche Criteria (BIC-SAC)</title>
<p>This criterion requires avalanche variables to be pairwise independent. It signifies that for a specified set of avalanche vectors generated, upon completing just one bit the avalanche variables must be pairwise independent.</p>
</sec>
<sec id="s2_5">
<label>2.5</label>
<title>Input/Output XOR or Differential Uniformity</title>
<p>Input variations can be used to generate output variations, and each output&#x2019;s XOR value must have a similar possibility as the XOR value of every input. It means that an S-box is resilient to differential cryptanalysis if the input/output probability distribution is closed. To provide sensible protection against differential attacks, S-box must have a small value of differential uniformity <inline-formula id="ieqn-5">
<mml:math id="mml-ieqn-5"><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:math>
</inline-formula>.</p>
<p>The details of all these cryptographic characteristics for benchmark nonlinear components are given in <xref ref-type="table" rid="table-1">Tab. 1</xref>. The selection of the best confusion component founded on the given six cryptographic criteria is the aim of our article.</p>
<table-wrap id="table-1"><label>Table 1</label>
<caption>
<title>Decision matrix of well-known cryptographic characteristics of S-boxes</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">S-boxes</th>
<th align="left"><inline-formula id="ieqn-46">
<mml:math id="mml-ieqn-46"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left"><inline-formula id="ieqn-47">
<mml:math id="mml-ieqn-47"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left"><inline-formula id="ieqn-48">
<mml:math id="mml-ieqn-48"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left"><inline-formula id="ieqn-49">
<mml:math id="mml-ieqn-49"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left"><inline-formula id="ieqn-50">
<mml:math id="mml-ieqn-50"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:math>
</inline-formula></th>
</tr>
</thead>
<tbody>
<tr>
<td align="left"><inline-formula id="ieqn-51">
<mml:math id="mml-ieqn-51"><mml:msub><mml:mi>B</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math>
</inline-formula>: AES [<xref ref-type="bibr" rid="ref-5">5</xref>]</td>
<td align="left">112</td>
<td align="left">0.5058</td>
<td align="left">0.504</td>
<td align="left">112</td>
<td align="left">4</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-52">
<mml:math id="mml-ieqn-52"><mml:msub><mml:mi>B</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math>
</inline-formula>: Skipjack [<xref ref-type="bibr" rid="ref-5">5</xref>]</td>
<td align="left">105.7</td>
<td align="left">0.498</td>
<td align="left">0.499</td>
<td align="left">104.1</td>
<td align="left">12</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-53">
<mml:math id="mml-ieqn-53"><mml:msub><mml:mi>B</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math>
</inline-formula>: Xyi [<xref ref-type="bibr" rid="ref-5">5</xref>]</td>
<td align="left">104</td>
<td align="left">0.5048</td>
<td align="left">0.503</td>
<td align="left">103.7</td>
<td align="left">12</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-54">
<mml:math id="mml-ieqn-54"><mml:msub><mml:mi>B</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>
</inline-formula>: Residue P [<xref ref-type="bibr" rid="ref-5">5</xref>]</td>
<td align="left">94</td>
<td align="left">0.5012</td>
<td align="left">0.502</td>
<td align="left">101.7</td>
<td align="left">72</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-55">
<mml:math id="mml-ieqn-55"><mml:msub><mml:mi>B</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:math>
</inline-formula>: Model 1 [<xref ref-type="bibr" rid="ref-5">5</xref>]</td>
<td align="left">101</td>
<td align="left">0.5036</td>
<td align="left">0.5037</td>
<td align="left">103.4</td>
<td align="left">10</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Decision Making Trial and Evaluation Laboratory (DEMATEL) Technique</title>
<p>The DEMATEL procedure was first proposed by the Science and Human Affairs Program of the Battle Memorial Institute of Geneva from 1972 to 1976. This method aims at identifying the relationship between cause and effect between certain selected criteria. This approach is comprehensive in the analysis and construction of models which are related to each other. The method seeks to find instantaneous or immediate relations (dependence) between variables in a system. It may also approve interdependence between the components and create a map that represents the links between them to address complex decision-making difficulties. DEMATEL can divide interdependency relationships into two groups: cause and effect. In a complicated structural system, it may also figure out the key factors with the use of the influential relation map [<xref ref-type="bibr" rid="ref-18">18</xref>].</p>
<p><bold>Mathematical Formulation of the DEMATEL Method</bold></p>
<p>The DEMATEL approach assumes that a system has a collection of components with evaluable pair-wise relationships. Let <inline-formula id="ieqn-6">
<mml:math id="mml-ieqn-6"><mml:mi>B</mml:mi><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>B</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>B</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>B</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math>
</inline-formula> be the components whose pair-wise relations can be evaluated and let <inline-formula id="ieqn-7">
<mml:math id="mml-ieqn-7"><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x003A;</mml:mo><mml:mrow><mml:mi mathvariant="normal">N</mml:mi><mml:mi mathvariant="normal">L</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>&#x003A;</mml:mo><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mi mathvariant="normal">C</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>&#x003A;</mml:mo><mml:mrow><mml:mi mathvariant="normal">B</mml:mi><mml:mi mathvariant="normal">I</mml:mi><mml:mi mathvariant="normal">C</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">A</mml:mi><mml:mi mathvariant="normal">C</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:mo>&#x003A;</mml:mo><mml:mrow><mml:mi mathvariant="normal">B</mml:mi><mml:mi mathvariant="normal">I</mml:mi><mml:mi mathvariant="normal">C</mml:mi></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mi mathvariant="normal">N</mml:mi><mml:mi mathvariant="normal">L</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x003A;</mml:mo><mml:mrow><mml:mi mathvariant="normal">I</mml:mi></mml:mrow><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="normal">O</mml:mi><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext><mml:mspace width="thickmathspace" /><mml:mtext>&#xA0;</mml:mtext><mml:mi mathvariant="normal">X</mml:mi><mml:mi mathvariant="normal">O</mml:mi><mml:mi mathvariant="normal">R</mml:mi></mml:mrow></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math>
</inline-formula> be the set of criteria. This method exhibits dependency among attributes and limits the relationship that considers the assets with an important structure and improvement pattern based on the properties of objective affairs. The DEMATEL method produces a graphical interpretation of its final product [<xref ref-type="bibr" rid="ref-18">18</xref>].</p>
<p><bold>Step 1:</bold> Formulation of Decision matrix.</p>
<p><bold>Step 2:</bold> Obtaining direct relation matrix requires a rating scale; each criterion is rated by the decision-maker using the scale given in Tab. 2. The sum of these values is calculated using <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>:<disp-formula id="eqn-1"><label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</disp-formula></p>
<p><bold>Step 3:</bold> Direct relation matrix is normalized utilizing <xref ref-type="disp-formula" rid="eqn-2">Eqs. (2)</xref> and <xref ref-type="disp-formula" rid="eqn-3">(3)</xref>:</p>
<p><disp-formula id="eqn-2"><label>(2)</label>
<mml:math id="mml-eqn-2" display="block"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mi>k</mml:mi><mml:mi>A</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-3"><label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:munder><mml:mrow><mml:mo form="prefix">max</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:munder><mml:mo>&#x2061;</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>n</mml:mi></mml:mstyle></mml:math>
</disp-formula></p>
<p><bold>Step 4:</bold> Let <inline-formula id="ieqn-8">
<mml:math id="mml-ieqn-8"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math>
</inline-formula> be the normalized decision matrix then using <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref> the total relation matrix can be obtained which gives the measure of how one factor or criteria affects the other:<disp-formula id="eqn-4"><label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:mi>T</mml:mi><mml:mo>=</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>X</mml:mi></mml:mrow><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo>.</mml:mo></mml:math>
</disp-formula></p>
<p><bold>Step 5:</bold> <italic>E&#x002B;R</italic> and <italic>E</italic>&#x2212;<italic>R</italic> are calculated, a greater magnitude of E&#x002B;R shows that criteria have maximum relation with other criteria, and its lesser magnitude shows minimum relationship with other criteria. A criterion having the highest value of E&#x002B;R is the most important criterion. A positive value of E&#x2212;R signifies it belongs to the cause group also known as dispatcher. These criteria influence other criteria. A Negative value of E&#x2212;R signifies that it belongs to the receiver group; they fall under the effect group which means these criteria get affected by other criteria.</p>
<p><bold>Step 6:</bold> Construction of Causal diagram.</p>
<p>Based on these steps, the DEMATEL method is based on the subsequent strides:</p>
<p><bold>Step 1:</bold> Defining the decision matrix</p>
<fig id="fig-2">
<label>Table 2</label>
<caption>
<title>Contrast range of the DEMATEL procedure</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_31855-fig-2.png"/>
</fig>
<p><bold>Step: 2</bold> Formulation of the direct relation matrix is described in <xref ref-type="table" rid="table-3">Tab. 3</xref>.</p>
<table-wrap id="table-3"><label>Table 3</label>
<caption>
<title>Direct relation matrix with quantitative characteristics</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Criteria</th>
<th align="left"><inline-formula id="ieqn-56">
<mml:math id="mml-ieqn-56"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left"><inline-formula id="ieqn-57">
<mml:math id="mml-ieqn-57"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left"><inline-formula id="ieqn-58">
<mml:math id="mml-ieqn-58"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left"><inline-formula id="ieqn-59">
<mml:math id="mml-ieqn-59"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left"><inline-formula id="ieqn-60">
<mml:math id="mml-ieqn-60"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left"><inline-formula id="ieqn-61">
<mml:math id="mml-ieqn-61"><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula></th>
</tr>
</thead>
<tbody>
<tr>
<td align="left"><inline-formula id="ieqn-62">
<mml:math id="mml-ieqn-62"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">0</td>
<td align="left">4</td>
<td align="left">4</td>
<td align="left">4</td>
<td align="left">4</td>
<td align="left">16</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-63">
<mml:math id="mml-ieqn-63"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">3</td>
<td align="left">0</td>
<td align="left">3</td>
<td align="left">3</td>
<td align="left">3</td>
<td align="left">12</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-64">
<mml:math id="mml-ieqn-64"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">3</td>
<td align="left">3</td>
<td align="left">0</td>
<td align="left">3</td>
<td align="left">3</td>
<td align="left">12</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-65">
<mml:math id="mml-ieqn-65"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">3</td>
<td align="left">4</td>
<td align="left">3</td>
<td align="left">0</td>
<td align="left">3</td>
<td align="left">13</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-66">
<mml:math id="mml-ieqn-66"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">3</td>
<td align="left">3</td>
<td align="left">3</td>
<td align="left">3</td>
<td align="left">0</td>
<td align="left">12</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><bold>Step: 3</bold> In this step the decision matrix is normalized utilizing <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref>. <xref ref-type="table" rid="table-4">Tab. 4</xref> describes the normalized direct relation matrix.
</p>
<table-wrap id="table-4"><label>Table 4</label>
<caption>
<title>Normalizing the direct relation matrix</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Criteria</th>
<th align="left"><inline-formula id="ieqn-67">
<mml:math id="mml-ieqn-67"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left"><inline-formula id="ieqn-68">
<mml:math id="mml-ieqn-68"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left"><inline-formula id="ieqn-69">
<mml:math id="mml-ieqn-69"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left"><inline-formula id="ieqn-70">
<mml:math id="mml-ieqn-70"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left"><inline-formula id="ieqn-71">
<mml:math id="mml-ieqn-71"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:math>
</inline-formula></th>
</tr>
</thead>
<tbody>
<tr>
<td align="left"><inline-formula id="ieqn-72">
<mml:math id="mml-ieqn-72"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">0</td>
<td align="left">0.25</td>
<td align="left">0.25</td>
<td align="left">0.25</td>
<td align="left">0.25</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-73">
<mml:math id="mml-ieqn-73"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">0.1875</td>
<td align="left">0</td>
<td align="left">0.1875</td>
<td align="left">0.1875</td>
<td align="left">0.1875</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-74">
<mml:math id="mml-ieqn-74"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">0.1875</td>
<td align="left">0.1875</td>
<td align="left">0</td>
<td align="left">0.1875</td>
<td align="left">0.1875</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-75">
<mml:math id="mml-ieqn-75"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">0.1875</td>
<td align="left">0.25</td>
<td align="left">0.1875</td>
<td align="left">0</td>
<td align="left">0.1875</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-76">
<mml:math id="mml-ieqn-76"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">0.1875</td>
<td align="left">0.1875</td>
<td align="left">0.1875</td>
<td align="left">0.1875</td>
<td align="left">0</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><disp-formula id="ueqn-3">
<mml:math id="mml-ueqn-3" display="block"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mi>k</mml:mi><mml:mo>.</mml:mo><mml:mi>A</mml:mi></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-5"><label>(5)</label>
<mml:math id="mml-eqn-5" display="block"><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:munder><mml:mrow><mml:mo form="prefix">max</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:munder><mml:mo>&#x2061;</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>n</mml:mi></mml:mstyle></mml:math>
</disp-formula></p>
<p><bold>Step 4:</bold> In this phase, the total relation matrix is computed. The total relation matrix gives the measure of how one factor or criteria affects the other. Let <inline-formula id="ieqn-9">
<mml:math id="mml-ieqn-9"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math>
</inline-formula> be the normalized decision matrix then <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref> is employed in calculating the total relation matrix <inline-formula id="ieqn-10">
<mml:math id="mml-ieqn-10"><mml:mi>T</mml:mi></mml:math>
</inline-formula> (<xref ref-type="table" rid="table-5">Tab. 5</xref>)</p>
<table-wrap id="table-5"><label>Table 5</label>
<caption>
<title>Total relation matrix of given cryptographic characteristics</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Criteria</th>
<th align="left"><inline-formula id="ieqn-77">
<mml:math id="mml-ieqn-77"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left"><inline-formula id="ieqn-78">
<mml:math id="mml-ieqn-78"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left"><inline-formula id="ieqn-79">
<mml:math id="mml-ieqn-79"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left"><inline-formula id="ieqn-80">
<mml:math id="mml-ieqn-80"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left"><inline-formula id="ieqn-81">
<mml:math id="mml-ieqn-81"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:math>
</inline-formula></th>
<th align="left">E</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left"><inline-formula id="ieqn-82">
<mml:math id="mml-ieqn-82"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">0.7993</td>
<td align="left">1.1073</td>
<td align="left"><bold>1.0519</bold></td>
<td align="left"><bold>1.0519</bold></td>
<td align="left"><bold>1.0519</bold></td>
<td align="left">5.0623</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-83">
<mml:math id="mml-ieqn-83"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">0.7889</td>
<td align="left">0.7613</td>
<td align="left">0.8304</td>
<td align="left">0.8304</td>
<td align="left">0.8304</td>
<td align="left">4.0414</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-84">
<mml:math id="mml-ieqn-84"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">0.7889</td>
<td align="left"><bold>0.8742</bold></td>
<td align="left">0.6726</td>
<td align="left">0.8304</td>
<td align="left">0.8304</td>
<td align="left">3.9965</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-85">
<mml:math id="mml-ieqn-85"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">0.8304</td>
<td align="left"><bold>0.9645</bold></td>
<td align="left"><bold>0.8742</bold></td>
<td align="left">0.7613</td>
<td align="left"><bold>0.8742</bold></td>
<td align="left">4.3046</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-86">
<mml:math id="mml-ieqn-86"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">0.7889</td>
<td align="left"><bold>0.8742</bold></td>
<td align="left">0.8304</td>
<td align="left">0.8304</td>
<td align="left">0.6726</td>
<td align="left">3.9965</td>
</tr>
<tr>
<td align="left">R</td>
<td align="left">3.9964</td>
<td align="left">4.5815</td>
<td align="left">4.2595</td>
<td align="left">4.3044</td>
<td align="left">4.2595</td>
<td align="left"/>
</tr>
</tbody>
</table>
</table-wrap>
<p><disp-formula id="eqn-6"><label>(6)</label>
<mml:math id="mml-eqn-6" display="block"><mml:mi>T</mml:mi><mml:mo>=</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>X</mml:mi></mml:mrow><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math>
</disp-formula></p>
<p><bold>Step 5:</bold> In this step rows and columns of the total relation matrix are summed up which have been presented in <xref ref-type="table" rid="table-6">Tab. 6</xref>.</p>
<table-wrap id="table-6"><label>Table 6</label>
<caption>
<title>Maximum and minimum E&#x002B;R, E&#x2212;R</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Criteria</th>
<th align="left">E</th>
<th align="left">R</th>
<th align="left">E&#x2212;R</th>
<th align="left">E&#x002B;R</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left"><inline-formula id="ieqn-87">
<mml:math id="mml-ieqn-87"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">5.0623</td>
<td align="left">3.9964</td>
<td align="left">1.0659</td>
<td align="left">9.0587</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-88">
<mml:math id="mml-ieqn-88"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">4.0414</td>
<td align="left">4.5815</td>
<td align="left">&#x2212;0.5401</td>
<td align="left">8.6229</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-89">
<mml:math id="mml-ieqn-89"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">3.9965</td>
<td align="left">4.2595</td>
<td align="left">&#x2212;0.263</td>
<td align="left">8.256</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-90">
<mml:math id="mml-ieqn-90"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">4.3046</td>
<td align="left">4.3044</td>
<td align="left">0.0002</td>
<td align="left">8.609</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-91">
<mml:math id="mml-ieqn-91"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">3.9965</td>
<td align="left">4.2595</td>
<td align="left">&#x2212;0.263</td>
<td align="left">8.256</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><bold>E&#x002B;R values:</bold></p>
<p>A criterion having a greater value of E&#x002B;R has the maximum relationship with other criteria, and those having a lesser value of E&#x002B;R have a lesser relationship with other criteria. A criterion having the highest value of E&#x002B;R is the most important criterion. We can see in <xref ref-type="table" rid="table-6">Tab. 6</xref> that nonlinearity has the highest E&#x002B;R value of 9.0587 which indicates that nonlinearity is the most important criterion.</p>

<p><bold>E&#x2212;R values:</bold></p>
<p>E&#x2212;R tells the kind of relation among criteria. A positive value of E&#x2212;R denotes it belongs to the cause group also known as dispatcher. These criteria influence other criteria. A Negative value of E&#x2212;R indicates it belongs to the receiver group; they fall under the effect group which means these criteria get affected by other criteria. We can see in <xref ref-type="table" rid="table-6">Tab. 6</xref> that NL and BIC-NL fall under the cause group, whereas SAC, BIC-SAC, and Input/output XOR fall under the effect group.</p>

<p><bold>Step 6:</bold> Constructing a causal diagram</p>
<p>The graphical relationship has been constructed in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. The criteria involved are Non-linearity, SAC, BIC of SAC, BIC of Non-linearity, and Input/output XOR. In this step, an average value of all the criteria presented in <xref ref-type="table" rid="table-7">Tab. 7</xref> is calculated termed the threshold value. In our case, the threshold value is <inline-formula id="ieqn-11">
<mml:math id="mml-ieqn-11"><mml:mi>&#x03B1;</mml:mi></mml:math>
</inline-formula> &#x003D; 0.856052 (<xref ref-type="fig" rid="fig-4">Fig. 3</xref>).</p>
<table-wrap id="table-7"><label>Table 7</label>
<caption>
<title>Weights of criteria</title></caption>
<table><colgroup><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Criteria</th>
<th align="left">Weights</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left"><inline-formula id="ieqn-92">
<mml:math id="mml-ieqn-92"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">0.003192</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-93">
<mml:math id="mml-ieqn-93"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">0.000026</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-94">
<mml:math id="mml-ieqn-94"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">0.000011</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-95">
<mml:math id="mml-ieqn-95"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">0.001134</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-96">
<mml:math id="mml-ieqn-96"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:math>
</inline-formula></td>
<td align="left">0.995637</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>It can be seen in <xref ref-type="fig" rid="fig-3">Fig. 2</xref> that non-linearity has a maximum relationship with Bit independence criteria of strict avalanche criteria, input/output XOR, and Bit independence criteria of non-linearity. Bit independence criteria of non-linearity have a relationship with SAC and BIC of SAC. Similarly, Bit independence criteria of strict avalanche criteria have a relationship with strict avalanche criteria. Input/output XOR has its relationship with Strict avalanche criteria.</p>
<fig id="fig-3">
<label>Figure 2</label>
<caption>
<title>Causal diagram</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_31855-fig-3.png"/>
</fig>
<fig id="fig-4">
<label>Figure 3</label>
<caption>
<title>Implementation of the proposed combination of Entropy and MOORA to determine the most vital criteria for the best confusion component of modern block ciphers</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_31855-fig-4.png"/>
</fig>
</sec>
<sec id="s4">
<label>4</label>
<title>Entropy Method for Assigning Weights</title>
<p>The entropy method has been formulated using probability theory; it measures uncertainty in the given information. Using the entropy approach, one may analyze a predetermined decision matrix. A wide distribution transmits more uncertainty than a tightly packed one, according to entropy in information theory, criteria for the amount of uncertainty represented by a discrete probability distribution [<xref ref-type="bibr" rid="ref-10">10</xref>]. The more the degree of dispersion, the more prominent the level of separation, and more data can be inferred. The greatest benefit of the entropy weighting method (EWM) is the aversion to human components obstructing the weights of indicators, thereby improving the objectivity of the overall assessment outcomes [<xref ref-type="bibr" rid="ref-14">14</xref>].</p>
<p><bold>The Mathematical Formulation of the Entropy Method</bold></p>
<p>The major objective of this part of the study is to discover the most significant cryptographic character of the S-box and its classification. In the present subsection, we are now adding a mathematical formulation of the Entropy method. This technique is based on probability theory which calculates uncertainty among given information.</p>
<p><bold>Step: 1</bold> In the first step the decision matrix is normalized. Let <inline-formula id="ieqn-12">
<mml:math id="mml-ieqn-12"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math>
</inline-formula> be the decision matrix, to calculate weights by entropy approach the information matrix is normalized using the mathematical relation:<disp-formula id="eqn-7"><label>(7)</label>
<mml:math id="mml-eqn-7" display="block"><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p><bold>Step: 2</bold> This step calculates entropy value using the <xref ref-type="disp-formula" rid="eqn-8">Eq. (8)</xref>:<disp-formula id="eqn-8"><label>(8)</label>
<mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mi>e</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>k</mml:mi><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mi>ln</mml:mi><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>n</mml:mi></mml:math>
</disp-formula></p>
<p><bold>Step: 3</bold> In this step the weight assigning vector <inline-formula id="ieqn-13">
<mml:math id="mml-ieqn-13"><mml:msub><mml:mi>w</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math>
</inline-formula> is computed for each criterion. It is based upon the sum <inline-formula id="ieqn-14">
<mml:math id="mml-ieqn-14"><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> and is divided by <inline-formula id="ieqn-15">
<mml:math id="mml-ieqn-15"><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math>
</inline-formula>. The weight vector <inline-formula id="ieqn-16">
<mml:math id="mml-ieqn-16"><mml:msub><mml:mi>w</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math>
</inline-formula> is given by:<disp-formula id="eqn-9"><label>(9)</label>
<mml:math id="mml-eqn-9" display="block"><mml:msub><mml:mi>w</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>n</mml:mi></mml:mstyle></mml:math>
</disp-formula></p>
<p>On this basis step entropy structure comprises the subsequent strides:</p>
<p><bold>Step 1:</bold> Normalizing the decision matrix</p>
<p>Let <inline-formula id="ieqn-17">
<mml:math id="mml-ieqn-17"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>x</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math>
</inline-formula> be the decision matrix, to determine the weights by entropy process first the information matrix is normalized using the mathematical relation described in <xref ref-type="disp-formula" rid="eqn-7">Eq. (7)</xref>:<disp-formula id="ueqn-4">
<mml:math id="mml-ueqn-4" display="block"><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:mstyle></mml:math>
</disp-formula>where <inline-formula id="ieqn-18">
<mml:math id="mml-ieqn-18"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>
</inline-formula> is the original measured data after obtaining the normalized matrix.</p>
<p><bold>Step 2:</bold> Calculating the entropy value</p>
<p>The value of entropy can be assessed using the subsequent mathematical structure:<disp-formula id="ueqn-5">
<mml:math id="mml-ueqn-5" display="block"><mml:msub><mml:mi>e</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>k</mml:mi><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mi>ln</mml:mi><mml:mo>&#x2061;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula>where <inline-formula id="ieqn-19">
<mml:math id="mml-ieqn-19"><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>ln</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</inline-formula> and &#x2018;<inline-formula id="ieqn-20">
<mml:math id="mml-ieqn-20"><mml:mi>p</mml:mi></mml:math>
</inline-formula>&#x2019; denotes the total number of choices. By taking <inline-formula id="ieqn-21">
<mml:math id="mml-ieqn-21"><mml:mi>p</mml:mi><mml:mo>=</mml:mo><mml:mn>5</mml:mn></mml:math>
</inline-formula>, <inline-formula id="ieqn-22">
<mml:math id="mml-ieqn-22"><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>ln</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>5</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow><mml:mo>=</mml:mo><mml:mn>0.6213</mml:mn></mml:mstyle></mml:math>
</inline-formula>.</p>
<p><bold>Step 3:</bold> Calculating weight vector</p>
<p>The weight vector <inline-formula id="ieqn-23">
<mml:math id="mml-ieqn-23"><mml:msub><mml:mi>w</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math>
</inline-formula> assigns weight to each criterion, the sum <inline-formula id="ieqn-24">
<mml:math id="mml-ieqn-24"><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> is divided by <inline-formula id="ieqn-25">
<mml:math id="mml-ieqn-25"><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math>
</inline-formula>. The following mathematical relation provides the weight vector <inline-formula id="ieqn-26">
<mml:math id="mml-ieqn-26"><mml:msub><mml:mi>w</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math>
</inline-formula>:<disp-formula id="ueqn-6">
<mml:math id="mml-ueqn-6" display="block"><mml:msub><mml:mi>w</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>.</mml:mo><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>n</mml:mi></mml:mstyle></mml:math>
</disp-formula></p>
</sec>
<sec id="s5">
<label>5</label>
<title>Multi-Objective Optimization Based on Ratio Analysis (MOORA) Method for Ranking</title>
<p>MOORA technique, first presented by Brauers et al. [<xref ref-type="bibr" rid="ref-26">26</xref>], is a multi-target improvement procedure that applies to any sort of complex decision-related issues. The MOORA technique consists of an initial decision matrix that contains the performance of different alternatives by taking into consideration various attributes.</p>
<p><bold>The Mathematical Formulation of the MOORA Scheme</bold></p>
<p><bold>Step: 1</bold> This method starts with a decision matrix that has <italic>m</italic> alternatives and <italic>n</italic> attributes<disp-formula id="ueqn-7">
<mml:math id="mml-ueqn-7" display="block"><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>11</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22F1;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math>
</disp-formula>where <inline-formula id="ieqn-27">
<mml:math id="mml-ieqn-27"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>
</inline-formula> is the execution of <inline-formula id="ieqn-28">
<mml:math id="mml-ieqn-28"><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math>
</inline-formula> alternative on <inline-formula id="ieqn-29">
<mml:math id="mml-ieqn-29"><mml:msup><mml:mi>k</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math>
</inline-formula> the attribute. The MOORA approach uses a ratio system to compare an alternative&#x2019;s answer to a denominator, which is the representative for all alternatives related to that aim.<disp-formula id="eqn-10"><label>(10)</label>
<mml:math id="mml-eqn-10" display="block"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mo>&#x2217;</mml:mo></mml:msubsup><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:munderover><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>n</mml:mi></mml:mstyle></mml:math>
</disp-formula></p>
<p><bold>Step: 2</bold> This step is known as optimization. In optimization, for the case of maximization responses are added and for minimization, responses are subtracted. This step is done using the following mathematical relation:<disp-formula id="eqn-11"><label>(11)</label>
<mml:math id="mml-eqn-11" display="block"><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>g</mml:mi></mml:munderover><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mo>&#x2217;</mml:mo></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mi>g</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mo>&#x2217;</mml:mo></mml:msubsup></mml:mrow></mml:mrow></mml:math>
</disp-formula></p>
<p><bold>Step: 3</bold> In this step weights <inline-formula id="ieqn-30">
<mml:math id="mml-ieqn-30"><mml:msub><mml:mi>w</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math>
</inline-formula> of <inline-formula id="ieqn-31">
<mml:math id="mml-ieqn-31"><mml:msup><mml:mi>k</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math>
</inline-formula> obtained by entropy method are multiplied with <inline-formula id="ieqn-32">
<mml:math id="mml-ieqn-32"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mo>&#x2217;</mml:mo></mml:msubsup></mml:math>
</inline-formula>, <inline-formula id="ieqn-33">
<mml:math id="mml-ieqn-33"><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math>
</inline-formula>&#x2019;s are calculated using the following mathematical relation:<disp-formula id="eqn-12"><label>(12)</label>
<mml:math id="mml-eqn-12" display="block"><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>g</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mo>&#x2217;</mml:mo></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mi>g</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mo>&#x2217;</mml:mo></mml:msubsup></mml:mrow></mml:mrow></mml:math>
</disp-formula></p>
<p>The sum of the decision matrix&#x2019;s maxima (benefit qualities) and minima (negative attributes) determines whether the <inline-formula id="ieqn-34">
<mml:math id="mml-ieqn-34"><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math>
</inline-formula> values are positive or negative (non-beneficial attributes). To express one&#x2019;s preference, one must provide an ordinal ordering of <inline-formula id="ieqn-35">
<mml:math id="mml-ieqn-35"><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math>
</inline-formula>. Thus, the best choice has the highest value, while the worst alternative has the lowest value consequently.</p>
<p>The <inline-formula id="ieqn-36">
<mml:math id="mml-ieqn-36"><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math>
</inline-formula> values can attain a positive or negative value depending on the sum of the decision matrix&#x2019;s maxima (beneficial attributes) and minima (non-beneficial attributes). Preferences are made by showing an ordinal ranking of <inline-formula id="ieqn-37">
<mml:math id="mml-ieqn-37"><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math>
</inline-formula>. As a result, the best option has the highest value, while the worst option has the lowest.</p>
<p>Multi-Objective optimizations based on Ratio Analysis (MOORA) method consist of the following steps:</p>
<p><bold>Step: 1 Normalization</bold></p>
<p>Let <inline-formula id="ieqn-38">
<mml:math id="mml-ieqn-38"><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>11</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22F1;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22EE;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math>
</inline-formula> be the decision matrix where <inline-formula id="ieqn-39">
<mml:math id="mml-ieqn-39"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math>
</inline-formula> is the performance of <inline-formula id="ieqn-40">
<mml:math id="mml-ieqn-40"><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math>
</inline-formula> alternative on <inline-formula id="ieqn-41">
<mml:math id="mml-ieqn-41"><mml:msup><mml:mi>k</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math>
</inline-formula> attribute, with <italic>m</italic> alternatives and n attributes. This is followed by the development of a ratio system, in which the accomplishments of each individual on a given attribute are measured against a denominator representing all of the possible outcomes for that attribute. It was discovered by Brauers et al. that the root of the sum of squares of each alternative for each characteristic is the sole possibility for this denominator when using various ratio systems, which include total ratios like Sch&#x00E4;rlig and Weitendorf as well as J&#x00FC;ttler and Stopp and K&#x00F6;rth [<xref ref-type="bibr" rid="ref-26">26</xref>]. The ratio has been presented in <xref ref-type="disp-formula" rid="eqn-10">Eq. (10)</xref>.</p>
<p><bold>Step: 2 Optimization</bold></p>
<p>In this step in case of maximization, responses are added and subtracted otherwise. This step is done using the mathematical relation given in <xref ref-type="disp-formula" rid="eqn-11">Eq. (11)</xref>.</p>
<p><bold>Step: 3 Multiplying weights</bold></p>
<p>In this step weights <inline-formula id="ieqn-42">
<mml:math id="mml-ieqn-42"><mml:msub><mml:mi>w</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math>
</inline-formula> of <inline-formula id="ieqn-43">
<mml:math id="mml-ieqn-43"><mml:msup><mml:mi>k</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math>
</inline-formula> obtained by the entropy method are multiplied with <inline-formula id="ieqn-44">
<mml:math id="mml-ieqn-44"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow><mml:mo>&#x2217;</mml:mo></mml:msubsup></mml:math>
</inline-formula>, <inline-formula id="ieqn-45">
<mml:math id="mml-ieqn-45"><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math>
</inline-formula>&#x2019;s are calculated using the mathematical relation given in <xref ref-type="disp-formula" rid="eqn-12">Eq. (12)</xref>.</p>
<p><xref ref-type="table" rid="table-8">Tab. 8</xref> represents the ranking of the alternatives using the MOORA method. It can be seen that the S-box of AES is ranked first with higher values of nonlinearity, BIC nonlinearity, SAC, and BIC-SAC, whereas the lowest value of I/O XOR. This shows that the S-box of AES is the best choice to be considered in an encryption scheme to achieve confusion.</p>
<table-wrap id="table-8"><label>Table 8</label>
<caption>
<title>Ranking of alternatives using the MOORA method</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">S-boxes</th>
<th align="left"><inline-formula id="ieqn-97">
<mml:math id="mml-ieqn-97"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math>
</inline-formula>:NL</th>
<th align="left"><inline-formula id="ieqn-98">
<mml:math id="mml-ieqn-98"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math>
</inline-formula>:SAC</th>
<th align="left"><inline-formula id="ieqn-99">
<mml:math id="mml-ieqn-99"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math>
</inline-formula>:BIC-SAC</th>
<th align="left"><inline-formula id="ieqn-100">
<mml:math id="mml-ieqn-100"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>
</inline-formula>:BIC-NL</th>
<th align="left"><inline-formula id="ieqn-101">
<mml:math id="mml-ieqn-101"><mml:msub><mml:mi>&#x03B6;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:math>
</inline-formula>: I/O XOR</th>
<th align="left">y</th>
<th align="left">Rank</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left"><inline-formula id="ieqn-102">
<mml:math id="mml-ieqn-102"><mml:msub><mml:mi>B</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math>
</inline-formula>: AES</td>
<td align="left">112</td>
<td align="left">0.5058</td>
<td align="left">0.504</td>
<td align="left">112</td>
<td align="left">4</td>
<td align="left">&#x2212;0.05117431</td>
<td align="left">1<sup>st</sup></td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-103">
<mml:math id="mml-ieqn-103"><mml:msub><mml:mi>B</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math>
</inline-formula>: Skipjack</td>
<td align="left">105.75</td>
<td align="left">0.4987</td>
<td align="left">0.4993</td>
<td align="left">104.1</td>
<td align="left">12</td>
<td align="left">&#x2212;0.15785115</td>
<td align="left">3<sup>rd</sup></td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-104">
<mml:math id="mml-ieqn-104"><mml:msub><mml:mi>B</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math>
</inline-formula>: Xyi</td>
<td align="left">104</td>
<td align="left">0.5048</td>
<td align="left">0.503</td>
<td align="left">103.7</td>
<td align="left">12</td>
<td align="left">&#x2212;0.15787703</td>
<td align="left">4<sup>th</sup></td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-105">
<mml:math id="mml-ieqn-105"><mml:msub><mml:mi>B</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>
</inline-formula>: Residue P</td>
<td align="left">94</td>
<td align="left">0.5012</td>
<td align="left">0.502</td>
<td align="left">101.7</td>
<td align="left">72</td>
<td align="left">&#x2212;0.95716691</td>
<td align="left">5<sup>th</sup></td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-106">
<mml:math id="mml-ieqn-106"><mml:msub><mml:mi>B</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:math>
</inline-formula>: Model 1</td>
<td align="left">101</td>
<td align="left">0.5036</td>
<td align="left">0.5037</td>
<td align="left">103.4</td>
<td align="left">10</td>
<td align="left">&#x2212;0.1312818</td>
<td align="left">2<sup>nd</sup></td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s6">
<label>6</label>
<title>Conclusion and Future Recommendations</title>
<p>In this paper, we aimed at finding the robust S-box with sound algebraic properties such as nonlinearity, SAC, BIC, BIC-SAC, BIC-NL, and DU. Multi-criteria decision-making method DEMATEL has been employed to study the interrelation among criteria which shows that Nonlinearity has the most impact on other criteria, which makes it the most important criteria for an S-box. Weights for the criteria have been assigned using the Entropy method and criteria are ranked using the MOORA method. It has been found that the S-box of AES is the optimal choice among other S-boxes.</p>
<p>Furthermore, the offered DEMATEL method can also be utilized for the selection of robust encryption methods. The secure cryptosystem can be selected by using some standard analysis such as correlation coefficient, entropy, histogram variance, GLCM measures, number of pixels changing rate, unified average changing intensity, mean square error, and peak signal to noise ratio. The best image, audio, and video encryption algorithms can be selected by using the above-defined analysis with the suggested DEMATEL method.</p>
</sec>
</body>
<back>
<ack>
<p>This research was funded by Princess Nourah bint Abdulrahman University Researchers Supporting Project Number (PNURSP2022R87), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.</p>
</ack><fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> This research was funded by Princess Nourah bint Abdulrahman University Researchers Supporting Project Number (PNURSP2022R87), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.</p>
</fn>
<fn fn-type="conflict">
<p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>M. M.</given-names> <surname>Hazzazi</surname></string-name>, <string-name><given-names>S. S.</given-names> <surname>Jamal</surname></string-name> and <string-name><given-names>I.</given-names> <surname>Hussain</surname></string-name></person-group>, &#x201C;<article-title>Image encryption scheme for multi-focus images for visual sensors network</article-title>,&#x201D; <source>Multimedia Tools and Applications</source>, vol. <volume>81</volume>, no. <issue>12</issue>, pp. <fpage>16353</fpage>&#x2013;<lpage>16370</lpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>I.</given-names> <surname>Hussain</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Shah</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Gondal</surname></string-name>, <string-name><given-names>W. A.</given-names> <surname>Khan</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Mahmood</surname></string-name></person-group>, &#x201C;<article-title>A group theoretic approach to construct cryptographically strong substitution boxes</article-title>,&#x201D; <source>Neural Computing and Applications</source>, vol. <volume>23</volume>, no. <issue>1</issue>, pp. <fpage>97</fpage>&#x2013;<lpage>104</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Rafiq</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Khan</surname></string-name></person-group>, &#x201C;<article-title>Construction of new S-boxes based on triangle groups and its applications in copyright protection</article-title>,&#x201D; <source>Multimedia Tools and Applications</source>, vol. <volume>78</volume>, no. <issue>11</issue>, pp. <fpage>15527</fpage>&#x2013;<lpage>15544</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Tang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Liao</surname></string-name> and <string-name><given-names>Y.</given-names> <surname>Chen</surname></string-name></person-group>, &#x201C;<article-title>A novel method for designing S-boxes based on chaotic maps</article-title>,&#x201D; <source>Chaos, Solitons &#x0026; Fractals</source>, vol. <volume>23</volume>, no. <issue>2</issue>, pp. <fpage>413</fpage>&#x2013;<lpage>419</lpage>, <year>2005</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>&#x00D6;zkaynak</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Yavuz</surname></string-name></person-group>, &#x201C;<article-title>Designing chaotic S-boxes based on time-delay chaotic system</article-title>,&#x201D; <source>Nonlinear Dynamics</source>, vol. <volume>74</volume>, no. <issue>3</issue>, pp. <fpage>551</fpage>&#x2013;<lpage>557</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Munir</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>M. M.</given-names> <surname>Hazzazi</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Aljaedi</surname></string-name>, <string-name><given-names>A. A. K. H.</given-names> <surname>Kareem</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Cryptanalysis of internet of health things encryption scheme based on chaotic maps</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>9</volume>, pp. <fpage>105678</fpage>&#x2013;<lpage>105685</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Munir</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>S. S.</given-names> <surname>Jamal</surname></string-name>, <string-name><given-names>M. M.</given-names> <surname>Hazzazi</surname></string-name> and <string-name><given-names>I.</given-names> <surname>Hussain</surname></string-name></person-group>, &#x201C;<article-title>Cryptanalysis of hybrid secure image encryption based on julia set fractals and three-dimensional lorenz chaotic map</article-title>,&#x201D; <source>Mathematics and Computers in Simulation</source>, vol. <volume>190</volume>, pp. <fpage>826</fpage>&#x2013;<lpage>836</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Munir</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Khan</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Shah</surname></string-name>, <string-name><given-names>A. S.</given-names> <surname>Alanazi</surname></string-name> and <string-name><given-names>I.</given-names> <surname>Hussain</surname></string-name></person-group>, &#x201C;<article-title>Cryptanalysis of nonlinear confusion component-based encryption algorithm</article-title>,&#x201D; <source>Integration</source>, vol. <volume>79</volume>, pp. <fpage>41</fpage>&#x2013;<lpage>47</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>I.</given-names> <surname>Hussain</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Shah</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Mahmood</surname></string-name></person-group>, &#x201C;<article-title>A new algorithm to construct secure keys for AES</article-title>,&#x201D; <source>International Journal of Contemporary Mathematical Sciences</source>, vol. <volume>5</volume>, no. <issue>26</issue>, pp. <fpage>1263</fpage>&#x2013;<lpage>1270</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>I.</given-names> <surname>Hussain</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Shah</surname></string-name>, <string-name><given-names>M. A.</given-names> <surname>Gondal</surname></string-name> and <string-name><given-names>W. A.</given-names> <surname>Khan</surname></string-name></person-group>, &#x201C;<article-title>Construction of cryptographically strong 8&#x2009;&#x00D7;&#x2009;8 S-boxes</article-title>,&#x201D; <source>World Applied Sciences Journal</source>, vol. <volume>13</volume>, no. <issue>11</issue>, pp. <fpage>2389</fpage>&#x2013;<lpage>2395</lpage>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>I.</given-names> <surname>Hussain</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Shah</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Mahmood</surname></string-name> and <string-name><given-names>M. A.</given-names> <surname>Gondal</surname></string-name></person-group>, &#x201C;<article-title>A projective general linear group based algorithm for the construction of substitution box for block ciphers</article-title>,&#x201D; <source>Neural Computing and Applications</source>, vol. <volume>22</volume>, no. <issue>6</issue>, pp. <fpage>1085</fpage>&#x2013;<lpage>1093</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Heron</surname></string-name></person-group>, &#x201C;<article-title>Advanced encryption standard (AES)</article-title>,&#x201D; <source>Network Security</source>, vol. <volume>2009</volume>, no. <issue>12</issue>, pp. <fpage>8</fpage>&#x2013;<lpage>12</lpage>, <year>2009</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Velasquez</surname></string-name> and <string-name><given-names>P. T.</given-names> <surname>Hester</surname></string-name></person-group>, &#x201C;<article-title>An analysis of multi-criteria decision-making methods</article-title>,&#x201D; <source>International Journal of Operations Research</source>, vol. <volume>10</volume>, no. <issue>2</issue>, pp. <fpage>56</fpage>&#x2013;6, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>N. H.</given-names> <surname>Zardari</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Ahmed</surname></string-name>, <string-name><given-names>S. M.</given-names> <surname>Shirazi</surname></string-name> and <string-name><given-names>Z. B.</given-names> <surname>Yusop</surname></string-name></person-group>, <source>Weighting Methods and Their Effects on Multi-Criteria Decision-Making Model Outcomes in Water Resources Management</source>, <publisher-loc>Heidelberg, New York, Dordrecht London</publisher-loc>: <publisher-name>Springer Cham</publisher-name>, <year>2015</year>. [Online]. Available: <uri xlink:href="https://link.springer.com/book/10.1007/978-3-319-12586-2">https://link.springer.com/book/10.1007/978-3-319-12586-2</uri>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. S.</given-names> <surname>Jamal</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Anees</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Ahmad</surname></string-name>, <string-name><given-names>M. F.</given-names> <surname>Khan</surname></string-name> and <string-name><given-names>I.</given-names> <surname>Hussain</surname></string-name></person-group>, &#x201C;<article-title>Construction of cryptographic S-boxes based on mobius transformation and chaotic tent-sine system</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>7</volume>, pp. <fpage>173273</fpage>&#x2013;<lpage>173285</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M. T.</given-names> <surname>Tran</surname></string-name>, <string-name><given-names>D. K.</given-names> <surname>Bui</surname></string-name> and <string-name><given-names>A. D.</given-names> <surname>Duong</surname></string-name></person-group>, &#x201C;<article-title>Gray S-box for advanced encryption standard</article-title>,&#x201D; in <conf-name>Proc. Int. Conf. on Computational Intelligence and Security</conf-name>, pp. <fpage>253</fpage>&#x2013;<lpage>258</lpage>, <year>Dec. 2008, Suzhou China</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author">N. Abughazalah, M. Khan, N. Munir and A. Zafar</person-group>, &#x201C;<article-title>Optimum criterion for lightweight nonlinear confusion component with multi-criteria decision making</article-title>,&#x201D; <source>Journal of Intelligent &#x0026; Fuzzy Systems</source>, vol. <volume>40</volume>, no. <issue>6</issue>, pp. <fpage>12399</fpage>&#x2013;<lpage>12410</lpage>, <year>2021</year>. </mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. V.</given-names> <surname>Devadoss</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Felix</surname></string-name></person-group>, &#x201C;<article-title>A fuzzy DEMATEL approach to study cause and effect relationship of youth violence</article-title>,&#x201D; <source>International Journal of Computing Algorithm</source>, vol. <volume>2</volume>, pp. <fpage>363</fpage>&#x2013;<lpage>372</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. A. R.</given-names> <surname>Khan</surname></string-name> and <string-name><given-names>M. K.</given-names> <surname>Jain</surname></string-name></person-group>, &#x201C;<article-title>Feature point detection for repacked android apps</article-title>,&#x201D; <source>Intelligent Automation &#x0026; Soft Computing</source>, vol. <volume>26</volume>, no. <issue>6</issue>, pp. <fpage>1359</fpage>&#x2013;<lpage>1373</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Binti</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Ahmad</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Mahmoud</surname></string-name> and <string-name><given-names>R. M.</given-names> <surname>Mehmood</surname></string-name></person-group>, &#x201C;<article-title>A pursuit of sustainable privacy protection in big data environment by an optimized clustered-purpose based algorithm</article-title>,&#x201D; <source>Intelligent Automation &#x0026; Soft Computing</source>, vol. <volume>26</volume>, no. <issue>6</issue>, pp. <fpage>1217</fpage>&#x2013;<lpage>1231</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Gumaei</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Al-Rakhami</surname></string-name>, <string-name><given-names>H.</given-names> <surname>AlSalman</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Md</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Alamri</surname></string-name></person-group>, &#x201C;<article-title>Dl-har: Deep learning-based human activity recognition framework for edge computing</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>65</volume>, no. <issue>2</issue>, pp. <fpage>1033</fpage>&#x2013;<lpage>1057</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>C. M.</given-names> <surname>Adams</surname></string-name> and <string-name><given-names>S. E.</given-names> <surname>Tavares</surname></string-name></person-group>, &#x201C;<article-title>The use of bent sequences to achieve higher-order strict avalanche criterion in S-box design</article-title>,&#x201D; <italic>Technical Report TR 90-013</italic>, <publisher-name>Dept. of Elec. Eng., Queen&#x2019;s University</publisher-name>, <publisher-loc>Kingston, Ontario, Canada</publisher-loc>, <year>1990</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Tesa&#x0159;</surname></string-name></person-group>, &#x201C;<article-title>A new method for generating high non-linearity s-boxes</article-title>,&#x201D; <source>Radio Engineering</source>, vol. <volume>19</volume>, no. <issue>1</issue>, pp. <fpage>23</fpage>&#x2013;<lpage>26</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F. N.</given-names> <surname>Al-Wesabi</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Alzahrani</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Alyarimi</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Abdul</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Nemri</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>A reliable NLP scheme for English text watermarking based on contents interrelationship</article-title>,&#x201D; <source>Computer Systems Science and Engineering</source>, vol. <volume>37</volume>, no. <issue>3</issue>, pp. <fpage>297</fpage>&#x2013;<lpage>311</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author">R. K. H. Mesran, M. Syahrizal, A. P. U. Siahaan and S. R. Rahim</person-group>, &#x201C;<article-title>Student admission assessment using multiobjective optimization on the basis of ratio analysis (MOORA)</article-title>,&#x201D; <source>Journal Online Jaringan COT POLIPD (JOJAPS)</source>, vol. <volume>10</volume>, no. <issue>7</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W. K. M.</given-names> <surname>Brauers</surname></string-name> and <string-name><given-names>E. K.</given-names> <surname>Zavadskas</surname></string-name></person-group>, &#x201C;<article-title>MULTIMOORA optimization used to decide on a bank loan to buy property</article-title>,&#x201D; <source>Technological and Economic Development of Economy</source>, vol. <volume>17</volume>, no. <issue>1</issue>, pp. <fpage>174</fpage>&#x2013;<lpage>188</lpage>, <year>2011</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>










