Title
Stochastic Fractal Search Algorithm Improved with Opposition-Based Learning for Solving the Substitution Box Design Problem
Date Issued
01 July 2022
Access level
open access
Resource Type
journal article
Author(s)
Gonzalez F.
Crawford B.
Pontificia Universidad Católica de Valparaíso
Publisher(s)
MDPI
Abstract
The main component of a cryptographic system that allows us to ensure its strength against attacks, is the substitution box. The strength of this component can be validated by various metrics, one of them being the nonlinearity. To this end, it is essential to develop a design for substitution boxes that allows us to guarantee compliance with this metric. In this work, we implemented a hybrid between the stochastic fractal search algorithm in conjunction with opposition-based learning. This design is supported by sequential model algorithm configuration for the proper parameters configuration. We obtained substitution boxes of high nonlinearity in comparison with other works based on metaheuristics and chaotic schemes. The proposed substitution box is evaluated using bijectivity, the strict avalanche criterion, nonlinearity, linear probability, differential probability and bit-independence criterion, which demonstrate the excellent performance of the proposed approach.
Volume
10
Issue
13
Language
English
OCDE Knowledge area
Estadísticas, Probabilidad Física de partículas, Campos de la Física
Scopus EID
2-s2.0-85133164777
Source
Mathematics
ISSN of the container
22277390
Sponsor(s)
Funding: Francisco González is supported by Postgraduate Grant Pontificia Universidad Católica de Valparaso, Chile, 2021. Ricardo Soto is supported by Grant CONICYT/FONDECYT/REGULAR/ 1190129. Broderick Crawford is supported by Grant CONICYT/FONDECYT/REGULAR/1210810.
Sources of information: Directorio de Producción Científica Scopus