# Human Psychological Disorder towards Cryptography: True Random Number Generator from EEG of Schizophrenics and Its Application in Block Encryption’s Substitution Box

Authors: Muhammad Fahad Khan; Khalid Saleem; Mohammad Mazyad Hazzazi; Mohammed Alotaibi; Piyush Kumar Shukla; Muhammad Aqeel; Seda Arslan Tuncer
Journal: Computational Intelligence and Neuroscience
 (2022)

---

## Abstract

Schizophrenia is a multifaceted chronic psychiatric disorder that affects the way a human thinks, feels, and behaves. Inevitably, natural randomness exists in the psychological perception of schizophrenic patients, which is our primary source of inspiration for this research because true randomness is the indubitably ultimate valuable resource for symmetric cryptography. Famous information theorist Claude Shannon gave two desirable properties that a strong encryption algorithm should have, which are confusion and diffusion in his fundamental article on the theoretical foundations of cryptography. Block encryption strength against various cryptanalysis attacks is purely dependent on its confusion property, which is gained through the confusion component. In the literature, chaos and algebraic techniques are extensively used to design the confusion component. Chaos- and algebraic-based techniques provide favorable features for the design of the confusion component; however, researchers have also identified potential attacks on these techniques. Instead of existing schemes, we introduce a novel methodology to construct cryptographic confusion component from the natural randomness, which are existing in the psychological perception of the schizophrenic patients, and as a result, cryptanalysis of chaos and algebraic techniques are not applicable on our proposed technique. The psychological perception of the brain regions was captured through the electroencephalogram (EEG) readings during the sensory task. The proposed design passed all the standard evaluation criteria and validation tests of the confusion component and the random number generators. One million true random bits are assessed through the NIST statistical test suite, and the results proved that the psychological perception of schizophrenic patients is a good source of true randomness. Furthermore, the proposed confusion component attains better or equal cryptographic strength as compared to state-of-the-art techniques (2020 to 2021). To the best of our knowledge, this nature of research is performed for the first time, in which psychiatric disorder is utilized for the design of information security primitive. This research opens up new avenues in cryptographic primitive design through the fusion of computing, neuroscience, and mathematics.


---

## Body

## 1. Introduction

Schizophrenia is a multifaceted psychiatric disorder, which consists of several varied causes such as environmental, developmental, and genetic factors. Due to numerous complications of its causes, inevitable natural randomness exists in the electroencephalographic readings of patient’s psychological responses. Patients who suffer from schizophrenia show randomness in their clinical presentation of symptoms, characteristics, and related prognosis. It is distinguished by three major clusters of symptoms consisting of cognitive symptoms including impairment of short- or long-term working memory, negative symptoms like social withdrawal, and positive symptoms like hallucinations or delusions. These symptoms stimulate diverse neural activities in the different regions of brain. Natural randomness has been acknowledged as the ideal method for cryptography and a lot of researchers endorse the true random numbers for cryptography due to the reason that true random numbers are irreversible, unpredictable, and unreproducible, even if their internal construction and response history are identifiable to the adversaries [1–8].Naturally, in the characteristics of the schizophrenic patients, diverse spectrum of disorders inevitably exists, which was our core source of inspiration because these disorders are the potential source of natural randomness. For example, in the delusion characteristic, patients lose their brain control due to their delusionary beliefs about the world around them. The loss of control stimulates uncertain and indistinct neural activities in different parts of the brain. These delusions could include grandiose, erotomaniac, and persecutory. Another characteristic of schizophrenic patients is the variation in the presentation of their sensory hallucinations, which differs between each patient. These hallucinations could be auditory, visual, tactile, gustatory, or olfactory. These hallucinations are also responsible for the arbitrariness of neural activities in brain regions. The third characteristic is a derailment, in which patients have variations in the thinking patterns and these disorganized thinking patterns are also a cause of irregular neural activity in different brain regions. The last characteristic is grossly disorganized or catatonic behavior, which causes variation in their presentation of motor behavior due to the imbalanced neural activities. These involuntary motor behaviors can range from childlike “silliness” to unpredictable agitation, which causes difficulty in goal-directed behavior.Protecting secret information is a global challenge, and block cipher has been a standout among the most reliable option by which security is accomplished [9–12]. Block ciphers belong to the family of deterministic algorithms that operate on the fixed length of bits (n), called a block. A block cipher algorithm divides the plaintext into several fixed-length blocks of n bits, to produce a block of ciphertext of k bits. Block cipher combines both confusion and diffusion components within a round function and repeats the function multiple times to produce a ciphered text. Advanced Encryption Standard and Data Encryption Standard are the most prominent block ciphers. For the block ciphers, differential and linear attacks are considered very powerful attacks [13–17]. The main objective of the differential attack is to find the nonrandom pattern of the output, and for this objective, the attacker attempts to impose a certain set of input to track the differences in the output. Similarly, the main objective of the linear attack is to try to learn the linear association between the parity bits of cipher text, plaintext, and the symmetric key. Responsibility to make the correlation between ciphertext and the key, as undetectable as possible, is only on the confusion component, as well as resistance against the cryptanalysis attacks totally depends upon the confusion component [13–22]. The confusion component of the block cipher is normally known as substitution box (S-box) or nonlinear block cipher primitive. Nonlinear block cipher primitive transforms m bits input to n bits output by using S: {0,1}n⟶{0,1}k.The ultimate goal of this research is to propose a methodology for the problem “how to construct the nonlinear primitive of block cipher using the strength of true randomness.” The core concept of this research is to extract true random bits, by calculating the difference between each electrode reading of one patient and those of all other patients, and to design a technique for the generation of nonlinear primitive of block cipher. The remaining study is arranged as follows: Section2 presents our main contribution; Section 3 describes attacks on existing confusion component designs; Section 4 explains the proposed scheme; Section 5 presents the results and its evaluation; and Section 6 presents the application of the proposed dynamic confusion components in image encryption technique.


## 2. Contribution

The main contribution of this research is as follows:(a)
A novel method is proposed, to generate true random bits from the psychological perception of schizophrenic patients. As test, one million true random bits are assessed through the NIST statistical test suite, and the results proved that the psychological perception of schizophrenic patients is outstanding source of true randomness.(b)
Instead of algebraic structures and chaotic systems, our technique relies on inevitable natural randomness, which are existing in EEG of schizophrenic patients for the design of confusion component, and as a result, attacks of algebraic- and chaos-based techniques are not applicable and irrelevant for our proposed technique.(c)
To the best of our knowledge, this nature of research is performed for the first time, in which psychiatric disorder is utilized for the design of any block cipher primitive.(d)
This research opens up new avenues in cryptographic primitive design through the fusion of computing, neuroscience, and mathematic.(e)
As the application of our proposed dynamic confusion components, an image cipher based on confusion-diffusion principal is also developed and the resultant encrypted images are examined through various security analyses and statistical tests. All the results of these tests are passed, and it also confirms that the proposed confusion components are competent enough for the image cipher.


## 3. Attacks on Confusion Component Design Schemes

As mentioned earlier, chaos- and algebraic-based techniques are extensively used to design the confusion component. Chaos- and algebraic-based techniques provide favorable features for the design of confusion components; however, researchers have also identified various cryptanalysis on these techniques including interpolation attacks [9–12], Gröbner basis attack [13–19], SAT solver [20–27], linear and differential attacks [28–42], XL attacks [43–45], and XSL attack [9, 46–55]. Similarly, chaos-based techniques are also commonly applied in the designs of confusion components [56–68], dynamical degradation of chaotic systems [69–73], predictability [74–85], discontinuity in chaotic sequences [70, 86–90], small number of control parameters [76, 77, 91, 92], finite precision effect [70–72, 86, 88], and short quantity of randomness [71, 72, 86, 88–90, 93–96].On the other side, a lot of researchers endorse the true random numbers for cryptography due to the purpose that true random numbers are unpredictable, unreproducible, and irreversible, even if their inner structure and past responses are known to the adversary. [1–8]. Our proposed technique extracts true random bits, from the readings of patient’s electrode scalp sites (Fz, FCz, Cz, FC3, FC4, C3, C4, CP3, CP4) during the sensory task.


## 4. Proposed Design

The proposed technique has two phases: true random bits extraction and dynamic generation of confusion components. The system architecture diagram is depicted in Figure1 and the whole design is explained in the following phases.Figure 1
Proposed system design.Figure 2
64-channel active-electrode layout.Phase 1.
True random bits extraction(a)
Acquire EEG readings from the basic sensory button press taskThe dataset that is used in this research was obtained from Refs. [97, 98], and for this, forty-nine schizophrenia patients were selected by professional and clinical psychologists after the initial screening of schizophrenia symptoms. Symptoms of the schizophrenia are assessed through three standardized psychological instruments: Scale for Negative Symptoms (SANS), Scale for Positive Symptoms (SAPS), and Positive and Negative Syndrome Scale (PANSS). The age range of the schizophrenia patients is 20 to 60 (μ = 42.82, σ = 13.12) years, and different subtypes of schizophrenic patients included such as residual schizophrenia, paranoid schizophrenia, undifferentiated schizophrenia, schizophrenia unknown subtype, schizoaffective disorder, and disorganized schizophrenia. Event-related potential (ERP) averages of nine electrode scalp sites (Fz, FCz, Cz, FC3, FC4, C3, C4, CP3, CP4) are obtained, and readings of the electroencephalography are continuously digitalized at 1024 Hz. The topological positions of the 64-channel, active-electrode layout is illustrated in Figure 2 [98]. The sensory task given to the participants consisted of a button press at every 1–2 seconds, to deliver 1000 Hz, 80 dB sound pressure level, and tones with zero delay between press and tone onset. The task was stopped after 100 tones had been delivered.(b)
Difference calculation between each electrode reading of one patient and each electrode reading of all other patientsEach reading of the 1st channel is subtracted, from the 1st channel reading, of all other patients. Similarly, each reading of the 2nd channel is subtracted, from the 2nd channel reading of all other patients. Subtracted readings of every channel are stored individually in vector data structure and then parsed into binary format. This process is repeated over the readings of 64 channels and 4900 vectors generated. As test, one million of these binary bits are assessed through the NIST statistical test suite, and the results of Table1 proved that the psychological perception of schizophrenic patients is a good source of true randomness.(c)
True Random Bits Fusion
The output of the last step is fused through the proposed DIFFERENCE_FUSION () algorithm, which is attached in annexed (FigureS1). A visual representation of the algorithm is depicted in Figure 3. This algorithm takes true random bits in the multiple of four vectors and then traverse in a specific order based on z-ordering. If the value of quadrant NW is 0, then retrieve bits from left to right, and if the value of quadrant NW is 1, then retrieve bits from right to left. Two variations of the z-ordering scheme are implemented here: the first is local z, which operates on 2 × 2 bits, and the second is global z, which operates on 2 × 2 local z.Figure 3
True random bits fusion.Figure 4
Difference-based two-dimensional map generation.Table 1
NIST statistical tests of SP-800-22.
Type of testP-valueFrequency test (monobit)0.64785502Frequency test within a block0.673576240Run test0.170731649Longest run of ones in a block0.875317043Binary matrix rank0.285809935Discrete Fourier transform (spectral)0.465626931Nonoverlapping template matching0.879441943Cumulative sums (reverse)0.896802069Cumulative sums (forward)0.631657291Overlapping template matching0.687280196Serial test0.625578760Linear complexity0.185625430Random excursions variantStateChi-squaredP-value−42.6935590560.747103374−34.4729411760.483511959−22.6456063910.754424291−18.6470588240.123997312112.294117650.03097253721.7305737110.88502570233.3440941180.64709795443.1523874860.676505457Random excursions variant testStateCountsP-value−920.532681604−850.595163147−770.634322683−670.605094946−570.567551017−460.475830847−350.357385716−280.372857936−190.1700669611210.4927166772160.92112655531714160.94831702151716270.6050949467390.2953610318460.199092429500.169870808Phase 2.
Dynamic generation of confusion components(a)
Difference-based Two-Dimensional Map Generation (D2DMG)Vectors of the last step are passed as parameters to the D2DMG() algorithm for the generation of two-dimensional maps. Visual representation of the algorithm is depicted in Figure4, and the D2DMG() algorithm is attached in annexed (Figure S2).(b)
Dynamic Confusion Component Generator (DCCG)
Pairwise randomly traverse all vectors from Phase 1 and then assign arbitrary indexes. Arbitrary indexes are produced simply by applying the module 3 operation on every byte of the vector. Here, arbitrary indexes work as indexes of the vector elements. To get the values of the confusion component, parameters (pair of vectors with their arbitrary index and map with its index) are passed to the ConfusionValuesGenerator() algorithm. ConfusionValuesGenerator algorithm is attached in annexed (FigureS3), and the visual representation of the algorithm is depicted in Figure 5. Due to the pure randomized nature, on every call, this algorithm returns 0 to 8 values. Resultant stream of the ConfusionValuesGenerator( ) algorithm was passed to the DCCG() algorithm for the generation of dynamic confusion components. The DCCG algorithm returns dynamic confusion components depending upon the size of stream; the DCCG algorithm is attached in annexed (Figure S4). From the results, six confusion components are randomly picked as samples, and first randomly picked confusion component and its inverse is shown in Tables 2 and 3 respectively, and the remaining five confusion components are shown in annexed (Table S1). The reverse S-box algorithm is shown in Algorithm 1.Algorithm 1: Reverse S-box (S-box).
in: 2D array of integers, sbox [16, 16];out: 2D array of integers, ReverseSbox [16, 16];(1)
ReverseSbox ⟶ |16||16|(2)
for row ⟶ 0 … (16) do(3)
for col ⟶ 0 … (16) do(4)
rowIS ⟶ sboxrow,col div 16(5)
colIS ⟶ sboxrow,col mod 16(6)
value ⟶ row∗16 + col(7)
ReverseSboxrowIS, colIS ⟶ value(8)
end for(9)
end for(10)
return ReverseSboxFigure 5
Confusion value generator.Table 2
Proposed confusion component-1.
9413320666120926811818711456167243937514320964673620215121157233162109212231502081611120319518016537215157632821278612131227210823112190742501908105311552161616013618532761521272559441634939198166811751598360101314820425132396942123135228181172491965423080189222244255110851761791821542211701917415132430862451771132345814219720734127314625413476124272181302381865252191242201219126106139156119115226103168452242204821024114017817317213842484122797891284016430192141702359772321252461992620065253551843523810010110711451021048247112129144142059916923194915324721784981931712252406223633116877918183131222292052214111885146158962371499518829153117712414713750Table 3
Inverse of confusion component-1.
1181991398716814266655518282321298320811560952301132352723321225269188136412481775764226128194193714074175170901177115724120416073255240236215981921023124708144224401719031868918025147130521413418343229100772038021810611922823917351214513024624317221921019619720115520256149198482610523820512291532272507152450469113518514868174206138232116113392622541671501631791251520720013125384245292167249110581513924279613125721763676111562111122211661651147810712116410835941092311936314182471015414417822021334971267518718914620338520921273016161224245237385921713714715911110228158222154171932349949184241231812252441958822316214512103120186216169965386143191132104


## 5. Results Evaluation

In this section, sample confusion components of Section 4 are evaluated through the standard confusion component evaluation criteria [32–44], which includes bit independence criterion(BIC), linear approximation probability (LP), strict avalanche criterion (SAC), nonlinearity score, and differential approximation probability (DP).


### 5.1. Nonlinearity

Nonlinearity is one of the most important confusion component properties, which indicates the resistance ability of confusion components against the linear attacks, and the nonlinearity of cipher is expressed by the nonlinearity score. It is known as the smallest distance of Boolean function from the set of affine functions. The nonlinearity score is the total number of bits altered to get the nearest affine function in the Boolean truth table. To calculate the nonlinearity score, the distance of all affine functions and Boolean function is determined. When the initial distance is calculated, the nearest affine function is achieved by changing the amount of bit values in the Boolean function’s truth table. The Walsh spectrum defines the nonlinearity of a Boolean function by using the following formula:(1)Ng=2n−11−2−nmaxφεGF2nSgφ,where Sgφ is defined as(2)Sgφ=∑φ∈GF2n−1gx⊕x.φ,where φ is a n-bit vector and φ∈GF2n. The dot product between x and φ is denoted as x⋅φ:(3)x⋅φ=x1⊕φ1+x2⊕φ2⋯+xn⊕φn.The nonlinearity score of our randomly picked confusion components 1,2,3,4,5,6 is 110.50, 106.75, 106.50, 106.75, 107.50, and 107.25, respectively. In Table4 we can see that the nonlinearity score of our proposed confusion components is higher or equal from the state-of-the-art techniques(year 2020 to 2021).Table 4
Nonlinearity of state-of-the-art techniques.
State-of-the-art confusion componentsNonlinearity score gained[99], 2021106.25[101], 2021106.5[103], 2021102.25[105], 2020106.5[107], 2020106.87[109], 2020104.25[111], 2020102.50[113], 2020106.25[115], 2020105.5[117], 2021106.75[114], 2020103.5[118], 2020106.5[119], 2020106.3[121], 2021104.0[122], 2021108.5[100], 2021109.75[102], 2021106.5[104], 2021105.5[106], 2021107.0[108], 2020105.25[110], 2020100.5[112], 2020104.0[114], 2020103.5[116], 2020105.0[118], 2020106.5[111], 2020102.5[109], 2020104.25[120], 2020101.75[121], 2021104.0[123], 2021105.25


### 5.2. Strict Avalanche Criteria (SAC)

SAC specify that all the output bits will be modified with 1/2 probability by flipping a bit of input. SAC analyze the impact of avalanche effects in encryption. The change in the input generates a number of changes in the output. Having an even output pattern prevents linear attacks. Therefore, the changes in the output bits must be independent. SAC counts the number of changed output bits caused by complementing a single bit of input. All output bits will deviate with the probability of one half for an algorithm to be more secure. To test the SAC of the confusion component, we used the dependency matrix. S-box fulfils the SAC property, if all the elements and mean value in the dependency matrix are approximately equal to 0.5. The offsets of the dependence matrix are calculated by the following formula:(4)Sg=1n2∑1≤r≤n∑1≤w≤n12−Qr,wg,where(5)Qr,wg=2−n∑xεBngwx⊕gwx⊕er,er=θr,1θr,2…θr,nT is the transpose of matrix θr,w=0,r≠w Or θr,wθr,w=1,r=wThe SAC (average) score of our randomly picked six confusion components (1,2,3,4,5,6) is 0.498779, 0.500244, 0.503662, 0.497314, 0.500732, and 0.508545, respectively. These results proved that our proposed confusion components are enough capable. The SAC result of confusion component-1 presented in Table5 is the sampleTable 5
SAC of confusion component-1.
0.4531250.5000000.5000000.5312500.5156250.5000000.4843750.5000000.4531250.5625000.5156250.5156250.5000000.4687500.4843750.4531250.5312500.5156250.5156250.4687500.5156250.5000000.5000000.5156250.5156250.4687500.5000000.4687500.5000000.5000000.5312500.5156250.5468750.5156250.5000000.4687500.4687500.5468750.5000000.4531250.5312500.5156250.4843750.5781250.4687500.5156250.5468750.4687500.4375000.5156250.4687500.4843750.5156250.5000000.5156250.4843750.5000000.4062500.4843750.5156250.4843750.5000000.5000000.500000


### 5.3. BIT Independent Criterion (BIC)

BIC is used to analyze the output bits behavior by changing the input bits. Confusion component holds the BIC property when output bits behave independently from each other. BIC characteristic states that output bitsj and k will modify individually if any single input bit i is reversed. This will improve the proficiency of confusion function. The independence between pair of avalanche variables is measured through the coefficient of correlation. The bit independence of the jth and kth bits of Bei is(6)BICbj,bk=max1≤i≤ncorrbjei,bjei′.Shannon’s confusion function(C) is represented asC: {0, 1}n ⟶{0, 1}n. BIC parameter for Shannon’s confusion function is measured by the given mathematical expression:(7)BICC=max1≤j,k≤nBICbj,bk.The shift in output bits is an important parameter for determining the strength of the encryption process. The average BIC score of our randomly picked confusion components from 1 to 6 is 0.50105, 0.50272, 0.50112, 0.50223, 0.50105, and 0.50105, respectively. These results proved that our proposed confusion components strongly fulfill the bit independent criteria. The SAC-BIC results of confusion component-1 presented in Table6 are the sample.Table 6
SAC of BIC.
—0.4902340.5058590.5019530.5136720.5097660.5078120.4980470.490234—0.5039060.5136720.4863280.4941410.4882810.4804690.5058590.503906—0.4882810.5039060.5136720.5136720.5273440.5019530.5136720.488281—0.5078120.4902340.5039060.5136720.5136720.4863280.5039060.507812—0.5136720.4804690.5019530.5097660.4941410.5136720.4902340.513672—0.4746090.4707030.5078120.4882810.5136720.5039060.4804690.474609—0.5312500.4980470.4804690.5273440.5136720.5019530.4707030.531250—


### 5.4. Linear Approximation Probability (LP)

LP is another important criteria for evaluating Shannon’s confusion component. LP is the function’s capability to avoid linear attacks and is the highest value of the disparity of an event. The input bit’s parity selected by the maskγ1 and the output bit’s parity selected by the γ2 mask are equal. The masks of input and output bits are evaluated to obtain the imbalance of an event. Linear approximation probability is measured by the following mathematical expression:(8)LPf=maxγ1,γ2≠0xɛX|x⋅γ1=Sx.γ22n−12,where γ1 represents the input mask and γ2 represents the output mask in the above equation. X represents the set of all possible inputs, and 2n is the total number of elements in the confusion component. The maximum LP score of our confusion components(1 to 6) is 0.1171875,0.1328125,0.12500, 0.1328125, 0.140625, and 0.140625, respectively; these results also fulfills the LP criteria.


### 5.5. Differential Approximation Probability (DP)

DP characteristic examines the XOR distribution among the input and output bits. In order to be resilient against the differential attacks, the XOR values of all outputs must have equal probability with the XOR values of all inputs. In the differential approximation table, the probability of all the XOR values of input and the probability of all XOR values of output are equal. The exclusive-or distribution among the inputs and outputs of S-box is calculated by(9)DPΔw⟶Δz=#wɛX|Sw⊕Sw⊕Δw=Δz2i.HereX represents the set of all possible input values and 2i represents cardinality of set. The maximum DP score of our confusion components (1 to 6) is 0.046875, 0.046875, 0.046875, 0.054688, 0.039062, and 0.054688, respectively; here, we can see that these results also fulfills the DP criteria. As a sample, the DP results of the confusion component-1 are presented in Table 7.Table 7
DP of the confusion component-1.
.00000.02344.03125.02344.02344.03125.02344.02344.03125.02344.02344.02344.02344.02344.02344.02344.02344.03125.02344.03125.02344.02344.02344.02344.02344.02344.02344.03125.03125.03125.03125.03125.02344.02344.02344.02344.02344.02344.03125.02344.03125.02344.02344.01562.03125.02344.02344.01562.02344.02344.02344.02344.02344.03125.03125.03125.02344.03125.03125.02344.02344.02344.02344.03125.02344.03125.03125.03125.02344.02344.02344.02344.02344.03125.02344.03125.02344.02344.02344.03125.02344.03906.03125.02344.02344.03125.03125.02344.02344.03125.02344.02344.03125.02344.03125.03125.03125.03125.02344.02344.02344.03125.03906.02344.03125.02344.03125.02344.03125.02344.04687.03125.02344.03125.02344.02344.02344.02344.02344.02344.03125.03125.03125.02344.02344.03125.01562.02344.03125.02344.02344.02344.02344.02344.02344.02344.02344.02344.01562.02344.02344.02344.03125.02344.02344.02344.02344.02344.02344.02344.02344.03125.02344.02344.03125.02344.02344.03125.02344.02344.02344.03125.03125.02344.03125.02344.03125.02344.03125.02344.03125.02344.02344.02344.02344.03125.02344.02344.01562.02344.02344.03125.02344.02344.02344.02344.03125.02344.02344.03125.01562.03125.02344.02344.02344.02344.02344.02344.02344.02344.03906.03125.03125.03906.03906.03125.02344.02344.03125.02344.02344.01562.02344.03125.02344.02344.02344.02344.02344.03906.03125.03125.02344.02344.02344.015625.02344.02344.03125.03125.03125.02344.02344.02344.02344.01562.02344.03125.02344.02344.03125.02344.03125.02344.02344.02344.03906.03125.02344.02344.03125.02344.02344.02344.03906.03125


## 5.1. Nonlinearity

Nonlinearity is one of the most important confusion component properties, which indicates the resistance ability of confusion components against the linear attacks, and the nonlinearity of cipher is expressed by the nonlinearity score. It is known as the smallest distance of Boolean function from the set of affine functions. The nonlinearity score is the total number of bits altered to get the nearest affine function in the Boolean truth table. To calculate the nonlinearity score, the distance of all affine functions and Boolean function is determined. When the initial distance is calculated, the nearest affine function is achieved by changing the amount of bit values in the Boolean function’s truth table. The Walsh spectrum defines the nonlinearity of a Boolean function by using the following formula:(1)Ng=2n−11−2−nmaxφεGF2nSgφ,where Sgφ is defined as(2)Sgφ=∑φ∈GF2n−1gx⊕x.φ,where φ is a n-bit vector and φ∈GF2n. The dot product between x and φ is denoted as x⋅φ:(3)x⋅φ=x1⊕φ1+x2⊕φ2⋯+xn⊕φn.The nonlinearity score of our randomly picked confusion components 1,2,3,4,5,6 is 110.50, 106.75, 106.50, 106.75, 107.50, and 107.25, respectively. In Table4 we can see that the nonlinearity score of our proposed confusion components is higher or equal from the state-of-the-art techniques(year 2020 to 2021).Table 4
Nonlinearity of state-of-the-art techniques.
State-of-the-art confusion componentsNonlinearity score gained[99], 2021106.25[101], 2021106.5[103], 2021102.25[105], 2020106.5[107], 2020106.87[109], 2020104.25[111], 2020102.50[113], 2020106.25[115], 2020105.5[117], 2021106.75[114], 2020103.5[118], 2020106.5[119], 2020106.3[121], 2021104.0[122], 2021108.5[100], 2021109.75[102], 2021106.5[104], 2021105.5[106], 2021107.0[108], 2020105.25[110], 2020100.5[112], 2020104.0[114], 2020103.5[116], 2020105.0[118], 2020106.5[111], 2020102.5[109], 2020104.25[120], 2020101.75[121], 2021104.0[123], 2021105.25


## 5.2. Strict Avalanche Criteria (SAC)

SAC specify that all the output bits will be modified with 1/2 probability by flipping a bit of input. SAC analyze the impact of avalanche effects in encryption. The change in the input generates a number of changes in the output. Having an even output pattern prevents linear attacks. Therefore, the changes in the output bits must be independent. SAC counts the number of changed output bits caused by complementing a single bit of input. All output bits will deviate with the probability of one half for an algorithm to be more secure. To test the SAC of the confusion component, we used the dependency matrix. S-box fulfils the SAC property, if all the elements and mean value in the dependency matrix are approximately equal to 0.5. The offsets of the dependence matrix are calculated by the following formula:(4)Sg=1n2∑1≤r≤n∑1≤w≤n12−Qr,wg,where(5)Qr,wg=2−n∑xεBngwx⊕gwx⊕er,er=θr,1θr,2…θr,nT is the transpose of matrix θr,w=0,r≠w Or θr,wθr,w=1,r=wThe SAC (average) score of our randomly picked six confusion components (1,2,3,4,5,6) is 0.498779, 0.500244, 0.503662, 0.497314, 0.500732, and 0.508545, respectively. These results proved that our proposed confusion components are enough capable. The SAC result of confusion component-1 presented in Table5 is the sampleTable 5
SAC of confusion component-1.
0.4531250.5000000.5000000.5312500.5156250.5000000.4843750.5000000.4531250.5625000.5156250.5156250.5000000.4687500.4843750.4531250.5312500.5156250.5156250.4687500.5156250.5000000.5000000.5156250.5156250.4687500.5000000.4687500.5000000.5000000.5312500.5156250.5468750.5156250.5000000.4687500.4687500.5468750.5000000.4531250.5312500.5156250.4843750.5781250.4687500.5156250.5468750.4687500.4375000.5156250.4687500.4843750.5156250.5000000.5156250.4843750.5000000.4062500.4843750.5156250.4843750.5000000.5000000.500000


## 5.3. BIT Independent Criterion (BIC)

BIC is used to analyze the output bits behavior by changing the input bits. Confusion component holds the BIC property when output bits behave independently from each other. BIC characteristic states that output bitsj and k will modify individually if any single input bit i is reversed. This will improve the proficiency of confusion function. The independence between pair of avalanche variables is measured through the coefficient of correlation. The bit independence of the jth and kth bits of Bei is(6)BICbj,bk=max1≤i≤ncorrbjei,bjei′.Shannon’s confusion function(C) is represented asC: {0, 1}n ⟶{0, 1}n. BIC parameter for Shannon’s confusion function is measured by the given mathematical expression:(7)BICC=max1≤j,k≤nBICbj,bk.The shift in output bits is an important parameter for determining the strength of the encryption process. The average BIC score of our randomly picked confusion components from 1 to 6 is 0.50105, 0.50272, 0.50112, 0.50223, 0.50105, and 0.50105, respectively. These results proved that our proposed confusion components strongly fulfill the bit independent criteria. The SAC-BIC results of confusion component-1 presented in Table6 are the sample.Table 6
SAC of BIC.
—0.4902340.5058590.5019530.5136720.5097660.5078120.4980470.490234—0.5039060.5136720.4863280.4941410.4882810.4804690.5058590.503906—0.4882810.5039060.5136720.5136720.5273440.5019530.5136720.488281—0.5078120.4902340.5039060.5136720.5136720.4863280.5039060.507812—0.5136720.4804690.5019530.5097660.4941410.5136720.4902340.513672—0.4746090.4707030.5078120.4882810.5136720.5039060.4804690.474609—0.5312500.4980470.4804690.5273440.5136720.5019530.4707030.531250—


## 5.4. Linear Approximation Probability (LP)

LP is another important criteria for evaluating Shannon’s confusion component. LP is the function’s capability to avoid linear attacks and is the highest value of the disparity of an event. The input bit’s parity selected by the maskγ1 and the output bit’s parity selected by the γ2 mask are equal. The masks of input and output bits are evaluated to obtain the imbalance of an event. Linear approximation probability is measured by the following mathematical expression:(8)LPf=maxγ1,γ2≠0xɛX|x⋅γ1=Sx.γ22n−12,where γ1 represents the input mask and γ2 represents the output mask in the above equation. X represents the set of all possible inputs, and 2n is the total number of elements in the confusion component. The maximum LP score of our confusion components(1 to 6) is 0.1171875,0.1328125,0.12500, 0.1328125, 0.140625, and 0.140625, respectively; these results also fulfills the LP criteria.


## 5.5. Differential Approximation Probability (DP)

DP characteristic examines the XOR distribution among the input and output bits. In order to be resilient against the differential attacks, the XOR values of all outputs must have equal probability with the XOR values of all inputs. In the differential approximation table, the probability of all the XOR values of input and the probability of all XOR values of output are equal. The exclusive-or distribution among the inputs and outputs of S-box is calculated by(9)DPΔw⟶Δz=#wɛX|Sw⊕Sw⊕Δw=Δz2i.HereX represents the set of all possible input values and 2i represents cardinality of set. The maximum DP score of our confusion components (1 to 6) is 0.046875, 0.046875, 0.046875, 0.054688, 0.039062, and 0.054688, respectively; here, we can see that these results also fulfills the DP criteria. As a sample, the DP results of the confusion component-1 are presented in Table 7.Table 7
DP of the confusion component-1.
.00000.02344.03125.02344.02344.03125.02344.02344.03125.02344.02344.02344.02344.02344.02344.02344.02344.03125.02344.03125.02344.02344.02344.02344.02344.02344.02344.03125.03125.03125.03125.03125.02344.02344.02344.02344.02344.02344.03125.02344.03125.02344.02344.01562.03125.02344.02344.01562.02344.02344.02344.02344.02344.03125.03125.03125.02344.03125.03125.02344.02344.02344.02344.03125.02344.03125.03125.03125.02344.02344.02344.02344.02344.03125.02344.03125.02344.02344.02344.03125.02344.03906.03125.02344.02344.03125.03125.02344.02344.03125.02344.02344.03125.02344.03125.03125.03125.03125.02344.02344.02344.03125.03906.02344.03125.02344.03125.02344.03125.02344.04687.03125.02344.03125.02344.02344.02344.02344.02344.02344.03125.03125.03125.02344.02344.03125.01562.02344.03125.02344.02344.02344.02344.02344.02344.02344.02344.02344.01562.02344.02344.02344.03125.02344.02344.02344.02344.02344.02344.02344.02344.03125.02344.02344.03125.02344.02344.03125.02344.02344.02344.03125.03125.02344.03125.02344.03125.02344.03125.02344.03125.02344.02344.02344.02344.03125.02344.02344.01562.02344.02344.03125.02344.02344.02344.02344.03125.02344.02344.03125.01562.03125.02344.02344.02344.02344.02344.02344.02344.02344.03906.03125.03125.03906.03906.03125.02344.02344.03125.02344.02344.01562.02344.03125.02344.02344.02344.02344.02344.03906.03125.03125.02344.02344.02344.015625.02344.02344.03125.03125.03125.02344.02344.02344.02344.01562.02344.03125.02344.02344.03125.02344.03125.02344.02344.02344.03906.03125.02344.02344.03125.02344.02344.02344.03906.03125


## 6. Application of Proposed Dynamic Confusion Components in Image Encryption

As the application of our proposed dynamic confusion components, an image cipher based on confusion-diffusion principal is developed, which is depicted in Figure6. The structure of the mage cipher is depicted in Figure 6. It consists of repeating rounds of dynamic confusion layers, static diffusion layer, and the key addition, which make them hard for cryptanalysis. For the key generation process, the chaotic interval of the logistic map and tent map is enhanced by synthesizing the parameters of both maps to obtain the increased keyspace [86]. The chaotic field of the logistic map only lies in the range between 3.57≤σ≤4, and similarly, the chaotic field of the tent map lies in the range between 2≤σ≤4. Logistic map and tent map are defined in (10) and (11), respectively, and their enhanced chaotification structure of logistic tent system(LTS) is defined in (12). Finally for the subkey generation, divide the resultant values of LTS into the blocks of 256 bytes. In the same way for the permutation process, apply XOR operation on the values generated from (11) and (12). These resultant values are in the range between 0 and 255. Select first 256 distinct values as permutation. We examined the encrypted images through various security analyses and statistical tests including NPCR, UACI, correlation-coefficient analysis, and 2D, 3D histogram analysis. All the results of these tests are passed; it also confirms that the proposed confusion is competent enough for the image cipher:(10)zn+1=σzn1−zn,0<σ≤4;zn∈0,1.(11)zn+1=γzn2zi<12,γ1−zn2zi>12,0<σ≤4;zn∈0,1.(12)zn+1=σzn1−zn+4−σzn/2mod255zi<1/2σzn1−zn+4−σ1−zn/2mod255zi>1/2.Figure 6
Confusion- and diffusion-based image cipher.


### 6.1. Resistance against Differential Analysis

The key requirement of the encryption algorithm is its ability to resist the differential attacks. Differential cryptanalysis is difficult when a small shift in original image will generate completely different ciphered image. We examined the image encryption results on various standard color test images (Lena, pepper, nature, bird, baboon, grapes, sparrow, butterfly), and here as a sample, original image pepper over the RGB channels is shown in Figures7(a)–7(c) and their correspondent cipher pictures are presented in Figures 7(d), 7(e), and 7(f). The NPCR and UACI are the two frequently used tests of the image cipher to check the strength against the differential attacks. NPCR is defined as follows [124, 125]:(13)NPCR=∑i,jDi,jW×H×100%.Figure 7
Original and encrypted test image of the pepper. (a) Before encryption(Channel:R); (b) before encryption (Channel:G); (c) before encryption (Channel:B); (d) after encryption(Channel:R); (e) after encryption (Channel:G); (f) after encryption (Channel:B).
(a)(b)(c)(d)(e)(f)D(i,j) is described as D(i,j) = 0 if I (i, j) = J(i, j), D(i,j) = 1 if I(i, j) = J(i, j)UAIC measure the mean variation of pixel intensity of two encrypted images at same location. It is determined by(14)UACI=1W×H×∑i,j×C1i,j−C2i,j255×100%,fx=0,ifC1i,j=C2i,j,1,ifC1i,j≠C2i,j,where C1i,j and C2i,j indicate the pixel value of two encrypted images at location i,j. W represents the number of rows and H presents the number of columns of the plain image. The encryption security is improved with a large UACI value. The NPCR and UACI are measured through the following formulas:(15)NPCRE=1−2−n×100%,UACIE=122n∑i=12n−1ii+12n−1×100%=131+2−n×100%,where n is the number of bits used to denote the various bit planes of an image. High values of UACI and NCPR have strong resistance against differential attacks. Table 8 indicates the values of NPCR and UACI. NPCR and UACI values of our encrypted images are near to 99.63 and 336.50, respectively, which are very good results.Table 8
NPC and UACI.
ImagesLocationNPCRUACIProposedProposedLenaR99.622133.5514G99.612733.5158B99.551733.5212PepperR99.623133.4525G99.646233.4642B99.665233.4935NatureR99.592533.6789G99.618633.4987B99.624533.6506BirdR99.662133.4065G99.665132.9154B99.626632.9365BaboonR99.657833.6534G99.625633.6385B99.634433.7265GrapesR99.623133.7596G99.665232.7821B99.663233.5063SparrowR99.655133.4798G99.622533.4125B99.643232.9098ButterflyR99.659133.5215G99.665232.9952B99.606333.0563


### 6.2. Correlation Coefficient Analysis

Neighbor pixels of the unencrypted images are extremely correlated and can show visual traits to the adversaries. An efficient cipher technique would reduce the correlation between adjacent pixels of an encrypted image in all the three directions. Before the encryption, the correlation coefficient value should be around 1 and after the encryption should be around 0. Adjacent pixel pairs of the test image pepper are plotted in Figures8, 9 and 10. From the both original and encrypted images, 1000 pixels are plotted in the diagonal, horizontal, and vertical direction. Correlation coefficient among two neighboring pixels are calculated by(16)rxy=covx,yDxDy,covx,y=1N∑i=1Nxi−Exyi−Ey,Dx=1N∑i=1Nxi−Ex2,Ex=1N∑i=1Nxi,where xi and yi show the values of two adjacent pixels and N is the total number of duplets. The mean value of xi is denoted by E(x), and the mean value of yi is denoted by E(y). The calculated value of the correlation coefficient in plain images is closer to 1 along diagonal, horizontal, and vertical directions, whereas the value of correlation coefficient in encrypted image is closer to 0. We can see that the values of the correlation coefficient over the encrypted images are totally different from the values of plain images, so the correlation coefficient attack fails to provide any clue of the original image. The results of the correlation coefficient analysis on horizontal, vertical, and diagonal directions are displayed in Table 9.Figure 8
Scatter plots of the test image pepper over the R channel. (a) Plain image (direction: horizontal); (b) plain image (direction: vertical); (c) plain image (direction: diagonal); (d) cipher image (direction: horizontal); (e) cipher image (direction: vertical); (f) cipher image (direction: diagonal).
(a)(b)(c)(d)(e)(f)Figure 9
Scatter plots of the test image pepper over the G channel. (a) Plain image (direction: horizontal); (b) plain image (direction: vertical); (c) plain image (direction: diagonal); (d) cipher image (direction: horizontal); (e) cipher image (direction: vertical); (f) cipher image (direction: diagonal).
(a)(b)(c)(d)(e)(f)Figure 10
Scatter plots of the test image pepper over the B channel. (a) Plain image (direction: horizontal); (b) plain image (direction: vertical); (c) plain image (direction: diagonal); (d) cipher image (direction: horizontal); (e) cipher image (direction: vertical); (f) cipher image (direction: diagonal).
(a)(b)(c)(d)(e)(f)Table 9
Correlation analysis of the adjacent pixels.
ImagesLocationHorizontalVerticalDiagonalPlainEncryptedPlainEncryptedPlainEncryptedLenaR.9302−.000005.9806.00011.9306.000071G.9426−.000462.9752−.00005.9360−.000051B.9061.000012.9503.00078.8803.000077PepperR.9252.000021.9303.00026.8745.000048G.9566−.000295.9806−.00008.9363−.000065B.9312.000212.9308.00015.8896.00023NatureR.9472−.000012.9512.00015.9101−.000069G.8833.000352.9313−.00012.8693.000019B.9702.000009.9708−.00082.9513.000038BirdR.9806.000021.9705.00010.9596−.000007G.9612−.000005.9603.00006.9298.000201B.9633−.000511.9512.00007.9319−.000039BaboonR.9659−.00008.9519−00006.9127.000047G.9559.000615.9201−.000031.8539−.00078B.9313−.000018.9499−.00002.9206.000071GrapesR.9836.000051.9826.00005.9568.000068G.9852.000005.9756−.000031.9627−.000064B.9788−.000047.9702.00003.9608−0.00051SparrowR.8866.000057.9236−.00004.9906−.000043G.9503−.000049.8352.00008.9804.000059B.9306−.000008.7952−.00070.9402.000021ButterflyR.9512−.000048.9800−0.0006.8845−.000034G.8999−.000007.8306.00021.9269.000062B.8802−.000008.7789.00056.8417.000081


### 6.3. Histogram Analysis

The histogram is the graphical representation of the distribution of pixels in the picture by measuring a number of pixels at each intensity level. Analyzing the histogram shows how pixels are distributed over encrypted image. Effective cipher encrypts the original image into the cipher image, which contains random RGB pixel. In Figure11, we can see that 3D histogram of the standard test images shows some information, but in Figure 12, encrypted test images have uniformly random pixel values. The histogram of the encrypted and original images are completely different, so the attacker cannot extract any relation between encrypted image and plain image.Figure 11
3D Histogram of the original images.Figure 12
3D Histogram of the encrypted images.


## 6.1. Resistance against Differential Analysis

The key requirement of the encryption algorithm is its ability to resist the differential attacks. Differential cryptanalysis is difficult when a small shift in original image will generate completely different ciphered image. We examined the image encryption results on various standard color test images (Lena, pepper, nature, bird, baboon, grapes, sparrow, butterfly), and here as a sample, original image pepper over the RGB channels is shown in Figures7(a)–7(c) and their correspondent cipher pictures are presented in Figures 7(d), 7(e), and 7(f). The NPCR and UACI are the two frequently used tests of the image cipher to check the strength against the differential attacks. NPCR is defined as follows [124, 125]:(13)NPCR=∑i,jDi,jW×H×100%.Figure 7
Original and encrypted test image of the pepper. (a) Before encryption(Channel:R); (b) before encryption (Channel:G); (c) before encryption (Channel:B); (d) after encryption(Channel:R); (e) after encryption (Channel:G); (f) after encryption (Channel:B).
(a)(b)(c)(d)(e)(f)D(i,j) is described as D(i,j) = 0 if I (i, j) = J(i, j), D(i,j) = 1 if I(i, j) = J(i, j)UAIC measure the mean variation of pixel intensity of two encrypted images at same location. It is determined by(14)UACI=1W×H×∑i,j×C1i,j−C2i,j255×100%,fx=0,ifC1i,j=C2i,j,1,ifC1i,j≠C2i,j,where C1i,j and C2i,j indicate the pixel value of two encrypted images at location i,j. W represents the number of rows and H presents the number of columns of the plain image. The encryption security is improved with a large UACI value. The NPCR and UACI are measured through the following formulas:(15)NPCRE=1−2−n×100%,UACIE=122n∑i=12n−1ii+12n−1×100%=131+2−n×100%,where n is the number of bits used to denote the various bit planes of an image. High values of UACI and NCPR have strong resistance against differential attacks. Table 8 indicates the values of NPCR and UACI. NPCR and UACI values of our encrypted images are near to 99.63 and 336.50, respectively, which are very good results.Table 8
NPC and UACI.
ImagesLocationNPCRUACIProposedProposedLenaR99.622133.5514G99.612733.5158B99.551733.5212PepperR99.623133.4525G99.646233.4642B99.665233.4935NatureR99.592533.6789G99.618633.4987B99.624533.6506BirdR99.662133.4065G99.665132.9154B99.626632.9365BaboonR99.657833.6534G99.625633.6385B99.634433.7265GrapesR99.623133.7596G99.665232.7821B99.663233.5063SparrowR99.655133.4798G99.622533.4125B99.643232.9098ButterflyR99.659133.5215G99.665232.9952B99.606333.0563


## 6.2. Correlation Coefficient Analysis

Neighbor pixels of the unencrypted images are extremely correlated and can show visual traits to the adversaries. An efficient cipher technique would reduce the correlation between adjacent pixels of an encrypted image in all the three directions. Before the encryption, the correlation coefficient value should be around 1 and after the encryption should be around 0. Adjacent pixel pairs of the test image pepper are plotted in Figures8, 9 and 10. From the both original and encrypted images, 1000 pixels are plotted in the diagonal, horizontal, and vertical direction. Correlation coefficient among two neighboring pixels are calculated by(16)rxy=covx,yDxDy,covx,y=1N∑i=1Nxi−Exyi−Ey,Dx=1N∑i=1Nxi−Ex2,Ex=1N∑i=1Nxi,where xi and yi show the values of two adjacent pixels and N is the total number of duplets. The mean value of xi is denoted by E(x), and the mean value of yi is denoted by E(y). The calculated value of the correlation coefficient in plain images is closer to 1 along diagonal, horizontal, and vertical directions, whereas the value of correlation coefficient in encrypted image is closer to 0. We can see that the values of the correlation coefficient over the encrypted images are totally different from the values of plain images, so the correlation coefficient attack fails to provide any clue of the original image. The results of the correlation coefficient analysis on horizontal, vertical, and diagonal directions are displayed in Table 9.Figure 8
Scatter plots of the test image pepper over the R channel. (a) Plain image (direction: horizontal); (b) plain image (direction: vertical); (c) plain image (direction: diagonal); (d) cipher image (direction: horizontal); (e) cipher image (direction: vertical); (f) cipher image (direction: diagonal).
(a)(b)(c)(d)(e)(f)Figure 9
Scatter plots of the test image pepper over the G channel. (a) Plain image (direction: horizontal); (b) plain image (direction: vertical); (c) plain image (direction: diagonal); (d) cipher image (direction: horizontal); (e) cipher image (direction: vertical); (f) cipher image (direction: diagonal).
(a)(b)(c)(d)(e)(f)Figure 10
Scatter plots of the test image pepper over the B channel. (a) Plain image (direction: horizontal); (b) plain image (direction: vertical); (c) plain image (direction: diagonal); (d) cipher image (direction: horizontal); (e) cipher image (direction: vertical); (f) cipher image (direction: diagonal).
(a)(b)(c)(d)(e)(f)Table 9
Correlation analysis of the adjacent pixels.
ImagesLocationHorizontalVerticalDiagonalPlainEncryptedPlainEncryptedPlainEncryptedLenaR.9302−.000005.9806.00011.9306.000071G.9426−.000462.9752−.00005.9360−.000051B.9061.000012.9503.00078.8803.000077PepperR.9252.000021.9303.00026.8745.000048G.9566−.000295.9806−.00008.9363−.000065B.9312.000212.9308.00015.8896.00023NatureR.9472−.000012.9512.00015.9101−.000069G.8833.000352.9313−.00012.8693.000019B.9702.000009.9708−.00082.9513.000038BirdR.9806.000021.9705.00010.9596−.000007G.9612−.000005.9603.00006.9298.000201B.9633−.000511.9512.00007.9319−.000039BaboonR.9659−.00008.9519−00006.9127.000047G.9559.000615.9201−.000031.8539−.00078B.9313−.000018.9499−.00002.9206.000071GrapesR.9836.000051.9826.00005.9568.000068G.9852.000005.9756−.000031.9627−.000064B.9788−.000047.9702.00003.9608−0.00051SparrowR.8866.000057.9236−.00004.9906−.000043G.9503−.000049.8352.00008.9804.000059B.9306−.000008.7952−.00070.9402.000021ButterflyR.9512−.000048.9800−0.0006.8845−.000034G.8999−.000007.8306.00021.9269.000062B.8802−.000008.7789.00056.8417.000081


## 6.3. Histogram Analysis

The histogram is the graphical representation of the distribution of pixels in the picture by measuring a number of pixels at each intensity level. Analyzing the histogram shows how pixels are distributed over encrypted image. Effective cipher encrypts the original image into the cipher image, which contains random RGB pixel. In Figure11, we can see that 3D histogram of the standard test images shows some information, but in Figure 12, encrypted test images have uniformly random pixel values. The histogram of the encrypted and original images are completely different, so the attacker cannot extract any relation between encrypted image and plain image.Figure 11
3D Histogram of the original images.Figure 12
3D Histogram of the encrypted images.


## 7. Conclusion

Randomness is a fundamental feature in nature and a valuable resource for the cryptography. First time, this nature of research is performed in which psychiatric disorder is utilized for the generation of truly random bits, and based on these true random bits, confusion components are constructed. Instead of algebraic- and chaotic-based approaches, our technique relies on inevitable natural randomness, which exists in the EEG of schizophrenic patients, and as a result, attacks of chaos- and algebraic-based techniques are bypassed in our proposed approach. For the evaluation of the true random bits, NIST statistical test suite was adopted, and for the evaluation of the confusion component, standard evaluation criteria were adopted. As a test case, one million true random bits are assessed through the NIST statistical test suite, and the results proved that the psychological perception of schizophrenic patients is a good source of true randomness. Confusion components are evaluated through SAC, LP, DP, BIC, and nonlinearity. The outcomes of these criteria verified that the proposed confusion component is effective for block ciphers. We will expand this research in future, for the dynamic generation of lattice primitives [70].



---

*Source: 2532497-2022-06-21.xml*