Execution examination of chaotic S-box dependent on improved PSO algorithm
- PDF / 3,689,648 Bytes
- 23 Pages / 595.276 x 790.866 pts Page_size
- 79 Downloads / 109 Views
(0123456789().,-volV)(0123456789(). ,- volV)
ORIGINAL ARTICLE
Execution examination of chaotic S-box dependent on improved PSO algorithm Nafiseh Hematpour1 • Sodeif Ahadpour1 Received: 21 April 2020 / Accepted: 18 August 2020 Ó Springer-Verlag London Ltd., part of Springer Nature 2020
Abstract Achieving proper nonlinear properties and autocorrelation in the S-box structure is an open challenge in cryptography. Besides, there have been numerous articles on the optimization of S-box, using two types of fitness functions for optimization. This study investigated both types of functions and compares their performance. In addition, this study used ergodic chaotic maps. First, the performance of particle swarm optimization (PSO) was improved using these maps. Then, the new chaotic S-boxes were designed based on the ergodic maps. After that, the improved PSO was used for optimization to obtain the best S-boxes. This optimization was performed once by selecting nonlinearity as a fitness function. At the second optimization, the entropy source was selected as a fitness function for optimization by examining the P-value of the mono-test frequency. Finally, the related results for the introduced chaotic S-boxes were compared to the optimized chaotic S-boxes with two types of fitness functions. The introduced S-boxes were safe due to the use of ergodic maps with high keyspace length. Furthermore, the simulation performance was analyzed and compared with other relevant approaches. Keywords Substitution boxes (S-boxes) Chaotic maps Particle swarm optimization Nonlinearity Mono-test frequency Performance analysis
1 Introduction Maintaining the security of information transmission is important given the significant advances in network communication technologies. A serious challenge in cryptosystems is designing of substitution boxes (S-boxes) [1]. S-box designs are proposed based on mathematical structures, a group of theoretic approach [2]. S-box, performing confusion, has been widely employed in traditional cryptographic standards such as the Data Encryption Standard (DES) [3] and the Advanced Encryption Standard (AES) [4] for encryption and decryption process. Considering that the previous designs still do not have the highest score for the good S-box criteria, it is necessary to create a new S-box structure. In order to determine how efficient the & Sodeif Ahadpour [email protected] Nafiseh Hematpour [email protected] 1
Department of Physics, University of Mohaghegh Ardabili, Ardabil, Iran
S-box is, it has been examined in the form of a series of criteria such as nonlinearity (NL), linear approximation (LP), differential approximation (DP), strictly avalanche criteria (SAC), and bit independence criteria (BIC) [5, 6]. Therefore, if it reaches 120 in nonlinearity attacks [7], it will be one of the most ideal possible arrangements against nonlinearity attacks. The best-obtained value of SAC is 0.500 [8]. The best values so far obtained for BIC, LP, and DP are 112, 0.062, and 4, respectively [4]. Researchers h
Data Loading...