Sine-Cosine Optimization-Based Bijective Substitution-Boxes Construction Using Enhanced Dynamics of Chaotic Map

This paper proposes a novel method of constructing strong substitution-boxes (S-boxes) of order n (4 ≤ n ≤ 8) based on a recent optimization algorithm known as sine-cosine algorithm (SCA). The paper also proposes a new 1D chaotic map, which owns enhanced dynamics compared to conventional chaotic map...

Full description

Bibliographic Details
Main Authors: Amer Awad Alzaidi, Musheer Ahmad, Hussam S. Ahmed, Eesa Al Solami
Format: Article
Language:English
Published: Hindawi-Wiley 2018-01-01
Series:Complexity
Online Access:http://dx.doi.org/10.1155/2018/9389065
id doaj-b76170bb883747abb944bd8f05ce3391
record_format Article
spelling doaj-b76170bb883747abb944bd8f05ce33912020-11-25T00:53:36ZengHindawi-WileyComplexity1076-27871099-05262018-01-01201810.1155/2018/93890659389065Sine-Cosine Optimization-Based Bijective Substitution-Boxes Construction Using Enhanced Dynamics of Chaotic MapAmer Awad Alzaidi0Musheer Ahmad1Hussam S. Ahmed2Eesa Al Solami3Department of Information Systems, University of Jeddah, Jeddah 21589, Saudi ArabiaDepartment of Computer Engineering, Jamia Millia Islamia, New Delhi 110025, IndiaFaculty of Computer Systems and Software Engineering, Universiti Malaysia Pahang, MalaysiaDepartment of Information Technology, University of Jeddah, Jeddah 21589, Saudi ArabiaThis paper proposes a novel method of constructing strong substitution-boxes (S-boxes) of order n (4 ≤ n ≤ 8) based on a recent optimization algorithm known as sine-cosine algorithm (SCA). The paper also proposes a new 1D chaotic map, which owns enhanced dynamics compared to conventional chaotic map, for generating initial population of S-boxes and facilitating the optimization mechanism of SCA. The proposed method applies the SCA with enhanced chaotic map to explore and exploit the search space for obtaining optimized S-boxes on the basis of maximization of nonlinearity as fitness function. The S-box construction involves three phases such as initialization of population, optimization, and adjustment. The simulation and performance analyses are done using standard measures of nonlinearity, strict avalanche criterion, bits independence criterion, differential uniformity, linear approximation probability, and autocorrelation function. The obtained experimental results are compared with some immediate optimization-based and other S-boxes to show the strength of proposed method for constructing bijective S-boxes of salient cryptographic features.http://dx.doi.org/10.1155/2018/9389065
collection DOAJ
language English
format Article
sources DOAJ
author Amer Awad Alzaidi
Musheer Ahmad
Hussam S. Ahmed
Eesa Al Solami
spellingShingle Amer Awad Alzaidi
Musheer Ahmad
Hussam S. Ahmed
Eesa Al Solami
Sine-Cosine Optimization-Based Bijective Substitution-Boxes Construction Using Enhanced Dynamics of Chaotic Map
Complexity
author_facet Amer Awad Alzaidi
Musheer Ahmad
Hussam S. Ahmed
Eesa Al Solami
author_sort Amer Awad Alzaidi
title Sine-Cosine Optimization-Based Bijective Substitution-Boxes Construction Using Enhanced Dynamics of Chaotic Map
title_short Sine-Cosine Optimization-Based Bijective Substitution-Boxes Construction Using Enhanced Dynamics of Chaotic Map
title_full Sine-Cosine Optimization-Based Bijective Substitution-Boxes Construction Using Enhanced Dynamics of Chaotic Map
title_fullStr Sine-Cosine Optimization-Based Bijective Substitution-Boxes Construction Using Enhanced Dynamics of Chaotic Map
title_full_unstemmed Sine-Cosine Optimization-Based Bijective Substitution-Boxes Construction Using Enhanced Dynamics of Chaotic Map
title_sort sine-cosine optimization-based bijective substitution-boxes construction using enhanced dynamics of chaotic map
publisher Hindawi-Wiley
series Complexity
issn 1076-2787
1099-0526
publishDate 2018-01-01
description This paper proposes a novel method of constructing strong substitution-boxes (S-boxes) of order n (4 ≤ n ≤ 8) based on a recent optimization algorithm known as sine-cosine algorithm (SCA). The paper also proposes a new 1D chaotic map, which owns enhanced dynamics compared to conventional chaotic map, for generating initial population of S-boxes and facilitating the optimization mechanism of SCA. The proposed method applies the SCA with enhanced chaotic map to explore and exploit the search space for obtaining optimized S-boxes on the basis of maximization of nonlinearity as fitness function. The S-box construction involves three phases such as initialization of population, optimization, and adjustment. The simulation and performance analyses are done using standard measures of nonlinearity, strict avalanche criterion, bits independence criterion, differential uniformity, linear approximation probability, and autocorrelation function. The obtained experimental results are compared with some immediate optimization-based and other S-boxes to show the strength of proposed method for constructing bijective S-boxes of salient cryptographic features.
url http://dx.doi.org/10.1155/2018/9389065
work_keys_str_mv AT amerawadalzaidi sinecosineoptimizationbasedbijectivesubstitutionboxesconstructionusingenhanceddynamicsofchaoticmap
AT musheerahmad sinecosineoptimizationbasedbijectivesubstitutionboxesconstructionusingenhanceddynamicsofchaoticmap
AT hussamsahmed sinecosineoptimizationbasedbijectivesubstitutionboxesconstructionusingenhanceddynamicsofchaoticmap
AT eesaalsolami sinecosineoptimizationbasedbijectivesubstitutionboxesconstructionusingenhanceddynamicsofchaoticmap
_version_ 1725237478674137088