Selective chaotic maps Tiki-Taka algorithm for the S-box generation and optimization

Cryptography often involves substituting (and converting) the secret information into dummy data so that it could reach the desired destination without leakage. Within symmetric key cryptography, substitution-box (S-box) is often adopted to perform the actual block cipher substitution. To address th...

Full description

Saved in:
Bibliographic Details
Published inNeural computing & applications Vol. 33; no. 23; pp. 16641 - 16658
Main Authors Zamli, Kamal Z., Kader, Abdul, Din, Fakhrud, Alhadawi, Hussam S.
Format Journal Article
LanguageEnglish
Published London Springer London 01.12.2021
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN0941-0643
1433-3058
DOI10.1007/s00521-021-06260-8

Cover

Abstract Cryptography often involves substituting (and converting) the secret information into dummy data so that it could reach the desired destination without leakage. Within symmetric key cryptography, substitution-box (S-box) is often adopted to perform the actual block cipher substitution. To address the nonlinear requirement of cryptography (i.e., ensuring the generated S-box is sufficiently robust against linear and differential cryptanalysis attacks), many chaos-based metaheuristic algorithms have been developed in the literature. This paper introduces a new variant of a metaheuristic algorithm based on Tiki-Taka algorithm, called selective chaotic maps Tiki-Taka algorithm (SCMTTA). Unlike competing works (which typically integrates a single chaotic map into a particular metaheuristic algorithm), SCMTTA assembles five chaotic maps (i.e., tent map, logistic map, Chebyshev map, singer map and sine map) as part of the algorithm itself in order to further enhance ergodicity and unpredictability of the generated solution. Based on a simple penalized and reward mechanism, one best performing chaotic map will be selected in the current cycle, while the poor performing one will miss its current turn. Experimental results on the case study related to the generation of 8 × 8 substitution-box demonstrate that the proposed SCMTTA gives competitive performance against other existing works due to its ability to adaptively modify its chaotic behavior based on the performance feedback of the current search process.
AbstractList Cryptography often involves substituting (and converting) the secret information into dummy data so that it could reach the desired destination without leakage. Within symmetric key cryptography, substitution-box (S-box) is often adopted to perform the actual block cipher substitution. To address the nonlinear requirement of cryptography (i.e., ensuring the generated S-box is sufficiently robust against linear and differential cryptanalysis attacks), many chaos-based metaheuristic algorithms have been developed in the literature. This paper introduces a new variant of a metaheuristic algorithm based on Tiki-Taka algorithm, called selective chaotic maps Tiki-Taka algorithm (SCMTTA). Unlike competing works (which typically integrates a single chaotic map into a particular metaheuristic algorithm), SCMTTA assembles five chaotic maps (i.e., tent map, logistic map, Chebyshev map, singer map and sine map) as part of the algorithm itself in order to further enhance ergodicity and unpredictability of the generated solution. Based on a simple penalized and reward mechanism, one best performing chaotic map will be selected in the current cycle, while the poor performing one will miss its current turn. Experimental results on the case study related to the generation of 8 × 8 substitution-box demonstrate that the proposed SCMTTA gives competitive performance against other existing works due to its ability to adaptively modify its chaotic behavior based on the performance feedback of the current search process.
Author Zamli, Kamal Z.
Alhadawi, Hussam S.
Kader, Abdul
Din, Fakhrud
Author_xml – sequence: 1
  givenname: Kamal Z.
  orcidid: 0000-0003-4626-0513
  surname: Zamli
  fullname: Zamli, Kamal Z.
  email: kamalz@ump.edu.my
  organization: Faculty of Computing, College of Computing and Applied Sciences, Universiti Malaysia Pahang
– sequence: 2
  givenname: Abdul
  surname: Kader
  fullname: Kader, Abdul
  organization: Faculty of Computing, College of Computing and Applied Sciences, Universiti Malaysia Pahang
– sequence: 3
  givenname: Fakhrud
  surname: Din
  fullname: Din, Fakhrud
  organization: Department of Computer Science and IT, Faculty of Information Technology, University of Malakand
– sequence: 4
  givenname: Hussam S.
  surname: Alhadawi
  fullname: Alhadawi, Hussam S.
  organization: Computers Technologies Engineering Department, Dijlah University College
BookMark eNp9kE9Lw0AQxRepYFv9Ap4WPEdns9nN5ijFf1Dw0HoOm2TSbptk6-5W1E9v0gqChx6GgZn3m3m8CRl1tkNCrhncMoD0zgOImEUwlIwlROqMjFnCecRBqBEZQ5YMq4RfkIn3GwBIpBJjslxgg2UwH0jLtbbBlLTVO0-XZmuipd5qqpuVdSasW1pbR8Ma6SIq7CddYYdOB2M7qruK2l0wrfk-DC7Jea0bj1e_fUreHh-Ws-do_vr0MrufRyVnWYgyJmpZqRqx1FldoihYzAtVpP1AskyAwkRVqBJZQyqA10JVUoBEKTSHSvIpuTne3Tn7vkcf8o3du65_mccii1Op4iTpVeqoKp313mGdlyYcfAanTZMzyIcM82OGOQw1ZJirHo3_oTtnWu2-TkP8CPle3K3Q_bk6Qf0ALFaGCw
CitedBy_id crossref_primary_10_1007_s11760_024_03109_0
crossref_primary_10_1007_s40747_023_00988_7
crossref_primary_10_1109_ACCESS_2022_3218062
crossref_primary_10_1016_j_aej_2024_11_014
crossref_primary_10_3390_math10132172
crossref_primary_10_1007_s00521_022_07589_4
crossref_primary_10_1016_j_eswa_2024_124904
crossref_primary_10_1016_j_icte_2022_11_005
crossref_primary_10_54365_adyumbd_1334213
crossref_primary_10_1007_s13369_024_09251_8
crossref_primary_10_1142_S0218127424502055
crossref_primary_10_1007_s11042_024_19053_7
crossref_primary_10_1109_ACCESS_2022_3209202
crossref_primary_10_1016_j_chaos_2024_115952
crossref_primary_10_1007_s00521_023_08243_3
crossref_primary_10_32604_jihpp_2024_058954
crossref_primary_10_1108_EC_03_2022_0185
crossref_primary_10_1007_s11042_023_17046_6
crossref_primary_10_1109_ACCESS_2024_3396452
crossref_primary_10_4108_eetsc_v7i1_2845
crossref_primary_10_1109_ACCESS_2024_3477260
crossref_primary_10_1007_s11277_021_08981_4
crossref_primary_10_1016_j_jisa_2022_103135
crossref_primary_10_1007_s00521_021_06442_4
crossref_primary_10_1007_s11042_023_17200_0
crossref_primary_10_1007_s13369_024_09010_9
crossref_primary_10_1016_j_knosys_2025_112968
crossref_primary_10_1109_ACCESS_2023_3266290
crossref_primary_10_35193_bseufbd_1323521
crossref_primary_10_1007_s11760_023_02984_3
crossref_primary_10_1016_j_matcom_2024_06_008
crossref_primary_10_1155_2022_7929846
crossref_primary_10_1007_s11277_023_10456_7
crossref_primary_10_1007_s00521_023_09095_7
crossref_primary_10_1007_s00521_022_07899_7
crossref_primary_10_1007_s11277_024_11104_4
Cites_doi 10.1016/j.knosys.2018.08.030
10.1016/j.jisa.2020.102671
10.1007/3-540-39799-X_41
10.1007/s10623-014-0006-x
10.1109/TCYB.2020.3020885
10.1007/s00521-020-05594-z
10.1007/s11071-016-3295-y
10.1007/s11071-012-0573-1
10.1016/j.procs.2015.07.394
10.1007/s00521-018-3557-3
10.1007/BFb0053732
10.1016/j.knosys.2015.07.006
10.1109/81.904880
10.1007/s11042-020-10048-8
10.1201/9780429492563
10.1109/TIT.2013.2252420
10.1109/SoCPaR.2009.21
10.1109/TFUZZ.2021.3053327
10.1155/2018/9389065
10.1002/j.1538-7305.1949.tb00928.x
10.1007/s00500-018-3102-4
10.1007/s12095-015-0170-5
10.1007/3-540-57220-1_60
10.1007/11502760_29
10.1007/s11071-012-0621-x
10.1145/2464576.2480776
10.1016/j.future.2019.02.028
10.1109/ICNN.1995.488968
10.1016/j.physleta.2012.01.009s
10.1016/j.chaos.2004.04.023
10.1108/ec-03-2020-0137
10.1007/11596219_5
10.1007/978-3-540-85912-3_31
10.1016/j.physleta.2010.07.019
10.1007/s11071-019-05413-8
10.1016/j.asoc.2019.03.012
10.1109/ACCESS.2019.2907012
10.6028/NBS.IR.77-1291
10.1155/2017/6969312
10.1016/j.ijleo.2016.11.152
10.1109/TIFS.2013.2285522
10.1109/ACCESS.2019.2893662
10.1109/CSIEC.2016.7482120
10.1007/978-3-319-10762-2_81
10.1007/s11071-013-0987-4
10.1007/3-540-48285-7_6
ContentType Journal Article
Copyright The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2021
The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2021.
Copyright_xml – notice: The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2021
– notice: The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2021.
DBID AAYXX
CITATION
8FE
8FG
AFKRA
ARAPS
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
DOI 10.1007/s00521-021-06260-8
DatabaseName CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central
Technology collection
ProQuest One Community College
ProQuest Central
SciTech Premium Collection
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
DatabaseTitle CrossRef
Advanced Technologies & Aerospace Collection
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest One Academic Eastern Edition
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
Advanced Technologies & Aerospace Database
ProQuest One Applied & Life Sciences
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList
Advanced Technologies & Aerospace Collection
Database_xml – sequence: 1
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1433-3058
EndPage 16658
ExternalDocumentID 10_1007_s00521_021_06260_8
GrantInformation_xml – fundername: Universiti Malaysia Pahang
  grantid: RDU 192211
  funderid: http://dx.doi.org/10.13039/501100005605
GroupedDBID -4Z
-59
-5G
-BR
-EM
-Y2
-~C
.4S
.86
.DC
.VR
06D
0R~
0VY
123
1N0
1SB
2.D
203
28-
29N
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
53G
5QI
5VS
67Z
6NX
8FE
8FG
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAOBN
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDBF
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABLJU
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSNA
ACUHS
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADMLS
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
B-.
B0M
BA0
BBWZM
BDATZ
BENPR
BGLVJ
BGNMA
BSONS
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
EAD
EAP
EBLON
EBS
ECS
EDO
EIOEI
EJD
EMI
EMK
EPL
ESBYG
EST
ESX
F5P
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I-F
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
KDC
KOV
KOW
LAS
LLZTM
M4Y
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
P19
P2P
P62
P9O
PF0
PT4
PT5
QOK
QOS
R4E
R89
R9I
RHV
RIG
RNI
RNS
ROL
RPX
RSV
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCJ
SCLPG
SCO
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
Z5O
Z7R
Z7S
Z7V
Z7W
Z7X
Z7Y
Z7Z
Z81
Z83
Z86
Z88
Z8M
Z8N
Z8P
Z8Q
Z8R
Z8S
Z8T
Z8U
Z8W
Z92
ZMTXR
~8M
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
ADKFA
AEZWR
AFDZB
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
PUEGO
DWQXO
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c319t-915f6d8feeca9fce5b123b8b7eec619508e48de846f07503f58d6506e65a30d63
IEDL.DBID AGYKE
ISSN 0941-0643
IngestDate Fri Jul 25 07:40:59 EDT 2025
Thu Apr 24 23:12:15 EDT 2025
Wed Oct 01 02:26:07 EDT 2025
Fri Feb 21 02:47:24 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 23
Keywords Tiki-Taka algorithm
Chaotic maps
Substitution-box
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c319t-915f6d8feeca9fce5b123b8b7eec619508e48de846f07503f58d6506e65a30d63
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-4626-0513
PQID 2592768244
PQPubID 2043988
PageCount 18
ParticipantIDs proquest_journals_2592768244
crossref_citationtrail_10_1007_s00521_021_06260_8
crossref_primary_10_1007_s00521_021_06260_8
springer_journals_10_1007_s00521_021_06260_8
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 20211200
2021-12-00
20211201
PublicationDateYYYYMMDD 2021-12-01
PublicationDate_xml – month: 12
  year: 2021
  text: 20211200
PublicationDecade 2020
PublicationPlace London
PublicationPlace_xml – name: London
– name: Heidelberg
PublicationTitle Neural computing & applications
PublicationTitleAbbrev Neural Comput & Applic
PublicationYear 2021
Publisher Springer London
Springer Nature B.V
Publisher_xml – name: Springer London
– name: Springer Nature B.V
References Osaba E, Diaz F, Onieva E (2013) A novel meta-heuristic based on soccer concepts to solve routing problems. In: Proceedings of the 15th annual conference companion on genetic and evolutionary computation. Association for Computing Machinery, pp. 1743–1744. Doi: https://doi.org/10.1145/2464576.2480776
FarahMABFarahAFarahTAn image encryption scheme based on a new hybrid chaotic map and optimized substitution boxNonlinear Dyn2020993041306410.1007/s11071-019-05413-8
Carlet C (2008) On the higher order nonlinearities of Boolean functions and S-boxes, and their generalizations. In: International conference on sequences and their applications. Springer, Berlin. pp. 345–367. https://doi.org/10.1007/978-3-540-85912-3_31
ShannonCECommunication theory of secrecy systemsBell Syst Tech J19492846567153213310.1002/j.1538-7305.1949.tb00928.x1200.94005
AroraSSinghSButterfly optimization algorithm: A novel approach for global optimizationSoft Comput201923371573410.1007/s00500-018-3102-4
QiuJWangTSunKRudasIJGaoHDisturbance observer-based adaptive fuzzy control for strict-feedback nonlinear systems with finite-time prescribed performanceIEEE Trans Fuzzy Syst202110.1109/TFUZZ.2021.3053327
TianYLuZChaotic S-box: intertwining logistic map and bacterial foraging optimizationMath Probl Eng20172017112372971910.1155/2017/69693121426.94127
TianYLuZS-box: Six-dimensional compound hyperchaotic map and artificial bee colony algorithmJ Syst Eng Electron2016271232241
AlhadawiHSMajidMALambićDAhmadMA novel method of S-box design based on discrete chaotic maps and cuckoo search algorithmMultimed Tools Appl202010.1007/s11042-020-10048-8
HeidariAAMirjaliliSFarisHAljarahIMafarjaMChenHHarris hawks optimization: algorithm and applicationsFutur Gener Comput Syst20199784987210.1016/j.future.2019.02.028
StrogatzSHNonlinear dynamics and chaos with student solutions manual: with applications to physics, biology, chemistry, and engineering2018CRC Press10.1201/9780429492563
YapiciHCetinkayaNA new meta-heuristic optimizer: Pathfinder algorithmAppl Soft Comput20197854556810.1016/j.asoc.2019.03.012
Fadakar E, Ebrahimi M (2016) A new metaheuristic football game inspired algorithm. In: Proceedings of the 1st conference on swarm intelligence and evolutionary computation. pp. 6–11. https://doi.org/10.1109/CSIEC.2016.7482120
QuLTanYLiCGongGMore constructions of differentially 4-uniform permutations on F(2^2k)Des Codes Crypt2016782391408345143110.1007/s10623-014-0006-x1401.94239
ÖzkaynakFÖzerABA method for designing strong S-Boxes based on chaotic Lorenz systemPhys Lett A2010374363733373810.1016/j.physleta.2010.07.0191238.34085
NybergKDifferentially uniform mappings for cryptographyProc Theor Appl Cryptograph Tech199310.1007/3-540-48285-7_60951.94510
QiuJJiWRudasIJGaoHAsynchronous sampled-data filtering design for fuzzy-affine-model-based stochastic nonlinear systemsIEEE Trans Cybern202010.1109/TCYB.2020.3020885
MilevaAStojanovaABikovDInvestigation of some cryptographic properties of the 8x8 S-boxes created by QuasigroupsComput Sci J Moldova2020288434637242028301469.94109
AlhadawiHSLambićDZolkipliMFAhmadMGlobalized firefly algorithm and chaos for designing substitution boxJ Inf Secur Appl20205511310.1016/j.jisa.2020.102671
ZamliKZKaderMAAzadSAhmedBS"Hybrid Henry gas solubility optimization algorithm with dynamic cluster-to-algorithm mappingNeural Comput Appl202110.1007/s00521-020-05594-z
FarahTRhoumaRBelghithSA novel method for designing S-box based on chaotic map and teaching–learning-based optimizationNonlinear Dyn20178821059107410.1007/s11071-016-3295-y
Khaji E (2014) Soccer league optimization: a heuristic algorithm inspired by the football system in european countries. http://arxiv.org/abs/1406.4462. pp. 1–6
MenezesAJVan OorschotPCVanstoneSAHandbook of applied cryptography1996CRC Press0868.94001
AhmadMBhatiaDHassanYA novel ant colony optimization based scheme for substitution box designProc Comput Sci20155757258010.1016/j.procs.2015.07.394
MirjaliliSMoth-flame optimization algorithm: a novel nature-inspired heuristic paradigmKnowl-Based Syst20158922824910.1016/j.knosys.2015.07.006
JakimoskiGKocarevLChaos and cryptography: block encryption ciphers based on chaotic mapsIEEE Trans Circuits and Sys I Fundament Theor Appl2001482163169182054110.1109/81.9048800998.94016
MatsuiMHellesethTLinear cryptanalysis method for DES cipherProceedings of the advances in cryptology1994BerlinSpringer386397
IvanovGNikolovNNikovaSReversed genetic algorithms for generation of bijective s-boxes with good cryptographic propertiesCryptogr Commun201682247276348821910.1007/s12095-015-0170-51338.94074
HussainIShahTGondalMAA novel approach for designing substitution-boxes based on nonlinear chaotic algorithmNonlinear Dyn201270317911794299217510.1007/s11071-012-0573-1
Al-OmoushAAAlsewariAAAlamriHSZamliKZ"Comprehensive review of the development of the harmony search algorithm and its applicationsIEEE Access20197142331424510.1109/ACCESS.2019.2893662
KhanMShahTMahmoodHGondalMAHussainIA novel technique for the construction of strong S-boxes based on chaotic Lorenz systemsNonlinear Dyn201270323032311299221610.1007/s11071-012-0621-x
TangGLiaoXChenYA novel method for designing S-boxes based on chaotic mapsChaos, Solitons Fract200523241341910.1016/j.chaos.2004.04.0231068.94017
MillanWBoydCDawsonEHow to improve the nonlinearity of bijective S-boxesProceedings of the information security and privacy1998BerlinSpringer18119210.1007/BFb0053732
Kashan AH (2009) League championship algorithm: a new algorithm for numerical function optimization. In: Proceedings of the international conference of soft computing and pattern recognition. pp. 43–48, doi: https://doi.org/10.1109/SoCPaR.2009.21
Carlet C (2005) On highly nonlinear S-boxes and their inability to thwart DPA attacks. In: Progress in cryptology. Springer, Berlin. pp. 49–62, doi: doi: https://doi.org/10.1007/11596219_5
WebsterAFTavaresSEWilliamsHCOn the design of S-boxesProceedings of the advances in cryptology1986BerlinSpringer52353410.1007/3-540-39799-X_41
AlzaidiAAAhmadMAhmedHSSolamiEASine cosine optimization-based bijective substitution-boxes construction using enhanced dynamics of chaotic mapComplexity2018201811610.1155/2018/9389065
WangYWongK-WLiCLiYA novel method to design S-box based on chaotic map and genetic algorithmPhys Lett A20123766–782783310.1016/j.physleta.2012.01.009s1255.81165
Picek S, Marchiori E, Batina L, Jakobovic D (2014) Combining evolutionary computation and algebraic constructions to find cryptography-relevant Boolean functions. In: International conference on parallel problem solving from nature. Springer, Cham. pp. 822–831. https://doi.org/10.1007/978-3-319-10762-2_81
AbdullahJMAhmedTFitness dependent optimizer: inspired by the bee swarming reproductive processIEEE Access20197434734348610.1109/ACCESS.2019.2907012
ZhaoWWangLZhangZAtom search optimization and its application to solve a hydrogeologic parameter estimation problemKnowl-Based Syst201916328330410.1016/j.knosys.2018.08.030
AhmedHAZolkipliMFAhmadMA novel efficient substitution-box design based on firefly algorithm and discrete chaotic mapNeural Comput Appl201931117201721010.1007/s00521-018-3557-3
ÖzkaynakFYavuzSDesigning chaotic S-boxes based on time-delay chaotic systemNonlinear Dyn2013743551557311764110.1007/s11071-013-0987-41344.94069
DaemenJRijmenVThe design of rijndael (Information Security and Cryptography)2020BerlinSpringer1437.94001
RashidMFFAbTiki-taka algorithm: a novel metaheuristic inspired by football playing styleEng Comput202010.1108/ec-03-2020-0137
KennedyJEberhartRParticle swarm optimizationProc Int Conf Neural Netw199541942194810.1109/ICNN.1995.488968
QuLTanYTanCHLiCConstructing differentially 4-uniform permutations over F(2^2k ) via the switching methodIEEE Trans Inf Theory201359746754686307135210.1109/TIT.2013.22524201364.94565
Detombe J, Tavares SE (1992) Proceedings of the advances in cryptology. In: Lecture notes in computer science, Springer-Verlag,pp. 165–181
MazumdarBMukhopadhyayDSenguptaIConstrained search for a class of good bijective S-boxes with improved DPA resistivityIEEE Trans Inf Forensics Secur20138122154216310.1109/TIFS.2013.2285522
BelaziAEl-LatifAAAA simple yet efficient S-box method based on chaotic sine mapOptik20171301438144410.1016/j.ijleo.2016.11.152
Prouff E (2005) DPA attacks and S-boxes. In: H. Gilbert and H. Handschuh, (Eds.,), Proceedings of the fast software encryption. Springer, Berlin, Heidelberg, Berlin Heidelberg, in Lecture Notes in Computer Science, pp. 424–441, doi: https://doi.org/10.1007/11502760_29
AlhadawiHSZolkipliMFAhmadMA novel efficient substitution-box design based on firefly algorithm and discrete chaotic mapNeural Comput Appl2018317201721010.1007/s00521-018-3557-3
Branstad DK, Gait J, Katzke S (1977) Report of the workshop on cryptography in support of computer security. National Bureau of Standards, NBS IR-77-1291
AF Webster (6260_CR50) 1986
Y Tian (6260_CR7) 2016; 27
JM Abdullah (6260_CR20) 2019; 7
6260_CR9
6260_CR8
J Kennedy (6260_CR16) 1995; 4
SH Strogatz (6260_CR24) 2018
HS Alhadawi (6260_CR46) 2020
I Hussain (6260_CR2) 2012; 70
H Yapici (6260_CR22) 2019; 78
B Mazumdar (6260_CR53) 2013; 8
T Farah (6260_CR43) 2017; 88
J Daemen (6260_CR29) 2020
G Jakimoski (6260_CR34) 2001; 48
L Qu (6260_CR32) 2016; 78
AA Al-Omoush (6260_CR40) 2019; 7
F Özkaynak (6260_CR5) 2013; 74
MFFAb Rashid (6260_CR11) 2020
K Nyberg (6260_CR30) 1993
G Tang (6260_CR35) 2005; 23
L Qu (6260_CR31) 2013; 59
6260_CR15
HS Alhadawi (6260_CR4) 2018; 31
6260_CR12
6260_CR14
6260_CR13
CE Shannon (6260_CR3) 1949; 28
6260_CR52
M Khan (6260_CR37) 2012; 70
6260_CR10
J Qiu (6260_CR25) 2020
W Millan (6260_CR38) 1998
MAB Farah (6260_CR44) 2020; 99
AJ Menezes (6260_CR1) 1996
M Matsui (6260_CR51) 1994
J Qiu (6260_CR26) 2021
HA Ahmed (6260_CR45) 2019; 31
Y Wang (6260_CR41) 2012; 376
S Arora (6260_CR19) 2019; 23
6260_CR49
F Özkaynak (6260_CR36) 2010; 374
6260_CR48
G Ivanov (6260_CR6) 2016; 8
A Belazi (6260_CR28) 2017; 130
A Mileva (6260_CR33) 2020; 28
AA Alzaidi (6260_CR47) 2018; 2018
AA Heidari (6260_CR21) 2019; 97
S Mirjalili (6260_CR17) 2015; 89
Y Tian (6260_CR42) 2017; 2017
M Ahmad (6260_CR27) 2015; 57
KZ Zamli (6260_CR39) 2021
HS Alhadawi (6260_CR23) 2020; 55
W Zhao (6260_CR18) 2019; 163
References_xml – reference: HussainIShahTGondalMAA novel approach for designing substitution-boxes based on nonlinear chaotic algorithmNonlinear Dyn201270317911794299217510.1007/s11071-012-0573-1
– reference: AhmedHAZolkipliMFAhmadMA novel efficient substitution-box design based on firefly algorithm and discrete chaotic mapNeural Comput Appl201931117201721010.1007/s00521-018-3557-3
– reference: Carlet C (2008) On the higher order nonlinearities of Boolean functions and S-boxes, and their generalizations. In: International conference on sequences and their applications. Springer, Berlin. pp. 345–367. https://doi.org/10.1007/978-3-540-85912-3_31
– reference: Khaji E (2014) Soccer league optimization: a heuristic algorithm inspired by the football system in european countries. http://arxiv.org/abs/1406.4462. pp. 1–6
– reference: MillanWBoydCDawsonEHow to improve the nonlinearity of bijective S-boxesProceedings of the information security and privacy1998BerlinSpringer18119210.1007/BFb0053732
– reference: RashidMFFAbTiki-taka algorithm: a novel metaheuristic inspired by football playing styleEng Comput202010.1108/ec-03-2020-0137
– reference: ShannonCECommunication theory of secrecy systemsBell Syst Tech J19492846567153213310.1002/j.1538-7305.1949.tb00928.x1200.94005
– reference: StrogatzSHNonlinear dynamics and chaos with student solutions manual: with applications to physics, biology, chemistry, and engineering2018CRC Press10.1201/9780429492563
– reference: QiuJWangTSunKRudasIJGaoHDisturbance observer-based adaptive fuzzy control for strict-feedback nonlinear systems with finite-time prescribed performanceIEEE Trans Fuzzy Syst202110.1109/TFUZZ.2021.3053327
– reference: BelaziAEl-LatifAAAA simple yet efficient S-box method based on chaotic sine mapOptik20171301438144410.1016/j.ijleo.2016.11.152
– reference: KhanMShahTMahmoodHGondalMAHussainIA novel technique for the construction of strong S-boxes based on chaotic Lorenz systemsNonlinear Dyn201270323032311299221610.1007/s11071-012-0621-x
– reference: QuLTanYLiCGongGMore constructions of differentially 4-uniform permutations on F(2^2k)Des Codes Crypt2016782391408345143110.1007/s10623-014-0006-x1401.94239
– reference: Fadakar E, Ebrahimi M (2016) A new metaheuristic football game inspired algorithm. In: Proceedings of the 1st conference on swarm intelligence and evolutionary computation. pp. 6–11. https://doi.org/10.1109/CSIEC.2016.7482120
– reference: NybergKDifferentially uniform mappings for cryptographyProc Theor Appl Cryptograph Tech199310.1007/3-540-48285-7_60951.94510
– reference: AhmadMBhatiaDHassanYA novel ant colony optimization based scheme for substitution box designProc Comput Sci20155757258010.1016/j.procs.2015.07.394
– reference: JakimoskiGKocarevLChaos and cryptography: block encryption ciphers based on chaotic mapsIEEE Trans Circuits and Sys I Fundament Theor Appl2001482163169182054110.1109/81.9048800998.94016
– reference: AbdullahJMAhmedTFitness dependent optimizer: inspired by the bee swarming reproductive processIEEE Access20197434734348610.1109/ACCESS.2019.2907012
– reference: ÖzkaynakFYavuzSDesigning chaotic S-boxes based on time-delay chaotic systemNonlinear Dyn2013743551557311764110.1007/s11071-013-0987-41344.94069
– reference: IvanovGNikolovNNikovaSReversed genetic algorithms for generation of bijective s-boxes with good cryptographic propertiesCryptogr Commun201682247276348821910.1007/s12095-015-0170-51338.94074
– reference: Prouff E (2005) DPA attacks and S-boxes. In: H. Gilbert and H. Handschuh, (Eds.,), Proceedings of the fast software encryption. Springer, Berlin, Heidelberg, Berlin Heidelberg, in Lecture Notes in Computer Science, pp. 424–441, doi: https://doi.org/10.1007/11502760_29
– reference: TianYLuZChaotic S-box: intertwining logistic map and bacterial foraging optimizationMath Probl Eng20172017112372971910.1155/2017/69693121426.94127
– reference: Carlet C (2005) On highly nonlinear S-boxes and their inability to thwart DPA attacks. In: Progress in cryptology. Springer, Berlin. pp. 49–62, doi: doi: https://doi.org/10.1007/11596219_5
– reference: DaemenJRijmenVThe design of rijndael (Information Security and Cryptography)2020BerlinSpringer1437.94001
– reference: Branstad DK, Gait J, Katzke S (1977) Report of the workshop on cryptography in support of computer security. National Bureau of Standards, NBS IR-77-1291
– reference: KennedyJEberhartRParticle swarm optimizationProc Int Conf Neural Netw199541942194810.1109/ICNN.1995.488968
– reference: WangYWongK-WLiCLiYA novel method to design S-box based on chaotic map and genetic algorithmPhys Lett A20123766–782783310.1016/j.physleta.2012.01.009s1255.81165
– reference: AroraSSinghSButterfly optimization algorithm: A novel approach for global optimizationSoft Comput201923371573410.1007/s00500-018-3102-4
– reference: ÖzkaynakFÖzerABA method for designing strong S-Boxes based on chaotic Lorenz systemPhys Lett A2010374363733373810.1016/j.physleta.2010.07.0191238.34085
– reference: MenezesAJVan OorschotPCVanstoneSAHandbook of applied cryptography1996CRC Press0868.94001
– reference: FarahMABFarahAFarahTAn image encryption scheme based on a new hybrid chaotic map and optimized substitution boxNonlinear Dyn2020993041306410.1007/s11071-019-05413-8
– reference: AlhadawiHSZolkipliMFAhmadMA novel efficient substitution-box design based on firefly algorithm and discrete chaotic mapNeural Comput Appl2018317201721010.1007/s00521-018-3557-3
– reference: Al-OmoushAAAlsewariAAAlamriHSZamliKZ"Comprehensive review of the development of the harmony search algorithm and its applicationsIEEE Access20197142331424510.1109/ACCESS.2019.2893662
– reference: TianYLuZS-box: Six-dimensional compound hyperchaotic map and artificial bee colony algorithmJ Syst Eng Electron2016271232241
– reference: MazumdarBMukhopadhyayDSenguptaIConstrained search for a class of good bijective S-boxes with improved DPA resistivityIEEE Trans Inf Forensics Secur20138122154216310.1109/TIFS.2013.2285522
– reference: QuLTanYTanCHLiCConstructing differentially 4-uniform permutations over F(2^2k ) via the switching methodIEEE Trans Inf Theory201359746754686307135210.1109/TIT.2013.22524201364.94565
– reference: Picek S, Marchiori E, Batina L, Jakobovic D (2014) Combining evolutionary computation and algebraic constructions to find cryptography-relevant Boolean functions. In: International conference on parallel problem solving from nature. Springer, Cham. pp. 822–831. https://doi.org/10.1007/978-3-319-10762-2_81
– reference: AlzaidiAAAhmadMAhmedHSSolamiEASine cosine optimization-based bijective substitution-boxes construction using enhanced dynamics of chaotic mapComplexity2018201811610.1155/2018/9389065
– reference: FarahTRhoumaRBelghithSA novel method for designing S-box based on chaotic map and teaching–learning-based optimizationNonlinear Dyn20178821059107410.1007/s11071-016-3295-y
– reference: Osaba E, Diaz F, Onieva E (2013) A novel meta-heuristic based on soccer concepts to solve routing problems. In: Proceedings of the 15th annual conference companion on genetic and evolutionary computation. Association for Computing Machinery, pp. 1743–1744. Doi: https://doi.org/10.1145/2464576.2480776
– reference: ZhaoWWangLZhangZAtom search optimization and its application to solve a hydrogeologic parameter estimation problemKnowl-Based Syst201916328330410.1016/j.knosys.2018.08.030
– reference: AlhadawiHSMajidMALambićDAhmadMA novel method of S-box design based on discrete chaotic maps and cuckoo search algorithmMultimed Tools Appl202010.1007/s11042-020-10048-8
– reference: MirjaliliSMoth-flame optimization algorithm: a novel nature-inspired heuristic paradigmKnowl-Based Syst20158922824910.1016/j.knosys.2015.07.006
– reference: MatsuiMHellesethTLinear cryptanalysis method for DES cipherProceedings of the advances in cryptology1994BerlinSpringer386397
– reference: YapiciHCetinkayaNA new meta-heuristic optimizer: Pathfinder algorithmAppl Soft Comput20197854556810.1016/j.asoc.2019.03.012
– reference: ZamliKZKaderMAAzadSAhmedBS"Hybrid Henry gas solubility optimization algorithm with dynamic cluster-to-algorithm mappingNeural Comput Appl202110.1007/s00521-020-05594-z
– reference: HeidariAAMirjaliliSFarisHAljarahIMafarjaMChenHHarris hawks optimization: algorithm and applicationsFutur Gener Comput Syst20199784987210.1016/j.future.2019.02.028
– reference: QiuJJiWRudasIJGaoHAsynchronous sampled-data filtering design for fuzzy-affine-model-based stochastic nonlinear systemsIEEE Trans Cybern202010.1109/TCYB.2020.3020885
– reference: WebsterAFTavaresSEWilliamsHCOn the design of S-boxesProceedings of the advances in cryptology1986BerlinSpringer52353410.1007/3-540-39799-X_41
– reference: MilevaAStojanovaABikovDInvestigation of some cryptographic properties of the 8x8 S-boxes created by QuasigroupsComput Sci J Moldova2020288434637242028301469.94109
– reference: Kashan AH (2009) League championship algorithm: a new algorithm for numerical function optimization. In: Proceedings of the international conference of soft computing and pattern recognition. pp. 43–48, doi: https://doi.org/10.1109/SoCPaR.2009.21
– reference: TangGLiaoXChenYA novel method for designing S-boxes based on chaotic mapsChaos, Solitons Fract200523241341910.1016/j.chaos.2004.04.0231068.94017
– reference: Detombe J, Tavares SE (1992) Proceedings of the advances in cryptology. In: Lecture notes in computer science, Springer-Verlag,pp. 165–181
– reference: AlhadawiHSLambićDZolkipliMFAhmadMGlobalized firefly algorithm and chaos for designing substitution boxJ Inf Secur Appl20205511310.1016/j.jisa.2020.102671
– volume: 163
  start-page: 283
  year: 2019
  ident: 6260_CR18
  publication-title: Knowl-Based Syst
  doi: 10.1016/j.knosys.2018.08.030
– volume: 28
  start-page: 346
  issue: 84
  year: 2020
  ident: 6260_CR33
  publication-title: Comput Sci J Moldova
– volume-title: The design of rijndael (Information Security and Cryptography)
  year: 2020
  ident: 6260_CR29
– volume: 55
  start-page: 1
  year: 2020
  ident: 6260_CR23
  publication-title: J Inf Secur Appl
  doi: 10.1016/j.jisa.2020.102671
– start-page: 523
  volume-title: Proceedings of the advances in cryptology
  year: 1986
  ident: 6260_CR50
  doi: 10.1007/3-540-39799-X_41
– volume: 78
  start-page: 391
  issue: 2
  year: 2016
  ident: 6260_CR32
  publication-title: Des Codes Crypt
  doi: 10.1007/s10623-014-0006-x
– volume-title: Handbook of applied cryptography
  year: 1996
  ident: 6260_CR1
– year: 2020
  ident: 6260_CR25
  publication-title: IEEE Trans Cybern
  doi: 10.1109/TCYB.2020.3020885
– year: 2021
  ident: 6260_CR39
  publication-title: Neural Comput Appl
  doi: 10.1007/s00521-020-05594-z
– volume: 88
  start-page: 1059
  issue: 2
  year: 2017
  ident: 6260_CR43
  publication-title: Nonlinear Dyn
  doi: 10.1007/s11071-016-3295-y
– volume: 70
  start-page: 1791
  issue: 3
  year: 2012
  ident: 6260_CR2
  publication-title: Nonlinear Dyn
  doi: 10.1007/s11071-012-0573-1
– volume: 57
  start-page: 572
  year: 2015
  ident: 6260_CR27
  publication-title: Proc Comput Sci
  doi: 10.1016/j.procs.2015.07.394
– volume: 31
  start-page: 7201
  issue: 11
  year: 2019
  ident: 6260_CR45
  publication-title: Neural Comput Appl
  doi: 10.1007/s00521-018-3557-3
– start-page: 181
  volume-title: Proceedings of the information security and privacy
  year: 1998
  ident: 6260_CR38
  doi: 10.1007/BFb0053732
– volume: 89
  start-page: 228
  year: 2015
  ident: 6260_CR17
  publication-title: Knowl-Based Syst
  doi: 10.1016/j.knosys.2015.07.006
– volume: 48
  start-page: 163
  issue: 2
  year: 2001
  ident: 6260_CR34
  publication-title: IEEE Trans Circuits and Sys I Fundament Theor Appl
  doi: 10.1109/81.904880
– year: 2020
  ident: 6260_CR46
  publication-title: Multimed Tools Appl
  doi: 10.1007/s11042-020-10048-8
– volume-title: Nonlinear dynamics and chaos with student solutions manual: with applications to physics, biology, chemistry, and engineering
  year: 2018
  ident: 6260_CR24
  doi: 10.1201/9780429492563
– volume: 59
  start-page: 4675
  issue: 7
  year: 2013
  ident: 6260_CR31
  publication-title: IEEE Trans Inf Theory
  doi: 10.1109/TIT.2013.2252420
– ident: 6260_CR13
  doi: 10.1109/SoCPaR.2009.21
– volume: 27
  start-page: 232
  issue: 1
  year: 2016
  ident: 6260_CR7
  publication-title: J Syst Eng Electron
– year: 2021
  ident: 6260_CR26
  publication-title: IEEE Trans Fuzzy Syst
  doi: 10.1109/TFUZZ.2021.3053327
– volume: 2018
  start-page: 1
  year: 2018
  ident: 6260_CR47
  publication-title: Complexity
  doi: 10.1155/2018/9389065
– volume: 28
  start-page: 656
  issue: 4
  year: 1949
  ident: 6260_CR3
  publication-title: Bell Syst Tech J
  doi: 10.1002/j.1538-7305.1949.tb00928.x
– volume: 23
  start-page: 715
  issue: 3
  year: 2019
  ident: 6260_CR19
  publication-title: Soft Comput
  doi: 10.1007/s00500-018-3102-4
– volume: 8
  start-page: 247
  issue: 2
  year: 2016
  ident: 6260_CR6
  publication-title: Cryptogr Commun
  doi: 10.1007/s12095-015-0170-5
– volume: 31
  start-page: 7201
  year: 2018
  ident: 6260_CR4
  publication-title: Neural Comput Appl
  doi: 10.1007/s00521-018-3557-3
– ident: 6260_CR49
  doi: 10.1007/3-540-57220-1_60
– ident: 6260_CR52
  doi: 10.1007/11502760_29
– volume: 70
  start-page: 2303
  issue: 3
  year: 2012
  ident: 6260_CR37
  publication-title: Nonlinear Dyn
  doi: 10.1007/s11071-012-0621-x
– ident: 6260_CR14
  doi: 10.1145/2464576.2480776
– volume: 97
  start-page: 849
  year: 2019
  ident: 6260_CR21
  publication-title: Futur Gener Comput Syst
  doi: 10.1016/j.future.2019.02.028
– volume: 4
  start-page: 1942
  year: 1995
  ident: 6260_CR16
  publication-title: Proc Int Conf Neural Netw
  doi: 10.1109/ICNN.1995.488968
– volume: 376
  start-page: 827
  issue: 6–7
  year: 2012
  ident: 6260_CR41
  publication-title: Phys Lett A
  doi: 10.1016/j.physleta.2012.01.009s
– volume: 23
  start-page: 413
  issue: 2
  year: 2005
  ident: 6260_CR35
  publication-title: Chaos, Solitons Fract
  doi: 10.1016/j.chaos.2004.04.023
– year: 2020
  ident: 6260_CR11
  publication-title: Eng Comput
  doi: 10.1108/ec-03-2020-0137
– ident: 6260_CR8
  doi: 10.1007/11596219_5
– ident: 6260_CR10
  doi: 10.1007/978-3-540-85912-3_31
– volume: 374
  start-page: 3733
  issue: 36
  year: 2010
  ident: 6260_CR36
  publication-title: Phys Lett A
  doi: 10.1016/j.physleta.2010.07.019
– volume: 99
  start-page: 3041
  year: 2020
  ident: 6260_CR44
  publication-title: Nonlinear Dyn
  doi: 10.1007/s11071-019-05413-8
– volume: 78
  start-page: 545
  year: 2019
  ident: 6260_CR22
  publication-title: Appl Soft Comput
  doi: 10.1016/j.asoc.2019.03.012
– volume: 7
  start-page: 43473
  year: 2019
  ident: 6260_CR20
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2019.2907012
– ident: 6260_CR48
  doi: 10.6028/NBS.IR.77-1291
– volume: 2017
  start-page: 1
  year: 2017
  ident: 6260_CR42
  publication-title: Math Probl Eng
  doi: 10.1155/2017/6969312
– ident: 6260_CR12
– volume: 130
  start-page: 1438
  year: 2017
  ident: 6260_CR28
  publication-title: Optik
  doi: 10.1016/j.ijleo.2016.11.152
– volume: 8
  start-page: 2154
  issue: 12
  year: 2013
  ident: 6260_CR53
  publication-title: IEEE Trans Inf Forensics Secur
  doi: 10.1109/TIFS.2013.2285522
– volume: 7
  start-page: 14233
  year: 2019
  ident: 6260_CR40
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2019.2893662
– ident: 6260_CR15
  doi: 10.1109/CSIEC.2016.7482120
– ident: 6260_CR9
  doi: 10.1007/978-3-319-10762-2_81
– volume: 74
  start-page: 551
  issue: 3
  year: 2013
  ident: 6260_CR5
  publication-title: Nonlinear Dyn
  doi: 10.1007/s11071-013-0987-4
– start-page: 386
  volume-title: Proceedings of the advances in cryptology
  year: 1994
  ident: 6260_CR51
– year: 1993
  ident: 6260_CR30
  publication-title: Proc Theor Appl Cryptograph Tech
  doi: 10.1007/3-540-48285-7_6
SSID ssj0004685
Score 2.439136
Snippet Cryptography often involves substituting (and converting) the secret information into dummy data so that it could reach the desired destination without...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 16641
SubjectTerms Algorithms
Artificial Intelligence
Chaos theory
Chebyshev approximation
Computational Biology/Bioinformatics
Computational Science and Engineering
Computer Science
Cryptography
Data Mining and Knowledge Discovery
Encryption
Heuristic methods
Image Processing and Computer Vision
Optimization
Original Article
Probability and Statistics in Computer Science
Search process
Substitutes
SummonAdditionalLinks – databaseName: ProQuest Central
  dbid: BENPR
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LTwIxEJ4gXLz4NqJoevCmjTx2S_dgjBoIMZEYWRJum263RQLsomDiz3dauqAmcuil2zbZTjvztdOZD-DSr0tRk6j9GlWlqRfzgAZNLSlnXEpPIGRQJt75ucs6fe9p4A8K0M1jYcyzylwnWkWdZNLckd8gTK8jNEZrdDd7p4Y1ynhXcwoN4agVklubYmwLSnWTGasIpYdW9-X1R6SkJenEM4157-M1XBiNDaYzN6RYa4pB-ZT_NlVr_PnHZWotUXsPdhyEJPdLme9DQaUHsJvTMxC3Ww8h7FmOG1RnRL6JDFuTqZjNSTgaj2goxoKIyRB_cfE2JQhdCUJB0qNx9kWGNhe1ERkRaUIyVCtTF695BP12K3zsUEeiQCXurgUqM1-zhGulpAi0VH6MtirmcRMrmOWAVR5PFMIQbX2a2ucJojammC8a1YQ1jqGYZqk6ASLwvCZwOK-WaM8PYs60bhpEwSQL_ECUoZbPVyRdhnFDdDGJVrmR7RxHVVPMHEe8DFerPrNlfo2NrSu5GCK31-bRemWU4ToXzfrz_6Odbh7tDLbrZjXYtysVKC4-PtU5IpBFfOGW1TdFqdX3
  priority: 102
  providerName: ProQuest
Title Selective chaotic maps Tiki-Taka algorithm for the S-box generation and optimization
URI https://link.springer.com/article/10.1007/s00521-021-06260-8
https://www.proquest.com/docview/2592768244
Volume 33
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVEBS
  databaseName: Academic Search Ultimate (EBSCO)
  customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn
  eissn: 1433-3058
  dateEnd: 20241105
  omitProxy: true
  ssIdentifier: ssj0004685
  issn: 0941-0643
  databaseCode: ABDBF
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn
  providerName: EBSCOhost
– providerCode: PRVEBS
  databaseName: Inspec with Full Text
  customDbUrl:
  eissn: 1433-3058
  dateEnd: 20241105
  omitProxy: false
  ssIdentifier: ssj0004685
  issn: 0941-0643
  databaseCode: ADMLS
  dateStart: 19930301
  isFulltext: true
  titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text
  providerName: EBSCOhost
– providerCode: PRVLSH
  databaseName: SpringerLink Journals
  customDbUrl:
  mediaType: online
  eissn: 1433-3058
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004685
  issn: 0941-0643
  databaseCode: AFBBN
  dateStart: 19970301
  isFulltext: true
  providerName: Library Specific Holdings
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl: http://www.proquest.com/pqcentral?accountid=15518
  eissn: 1433-3058
  dateEnd: 20241105
  omitProxy: true
  ssIdentifier: ssj0004685
  issn: 0941-0643
  databaseCode: BENPR
  dateStart: 20120101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Technology Collection
  customDbUrl:
  eissn: 1433-3058
  dateEnd: 20241105
  omitProxy: true
  ssIdentifier: ssj0004685
  issn: 0941-0643
  databaseCode: 8FG
  dateStart: 20180401
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/technologycollection1
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerLINK - Czech Republic Consortium
  customDbUrl:
  eissn: 1433-3058
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004685
  issn: 0941-0643
  databaseCode: AGYKE
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://link.springer.com
  providerName: Springer Nature
– providerCode: PRVAVX
  databaseName: SpringerLink Journals (ICM)
  customDbUrl:
  eissn: 1433-3058
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0004685
  issn: 0941-0643
  databaseCode: U2A
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://www.springerlink.com/journals/
  providerName: Springer Nature
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bT8IwFD4RePHFuxEvpA--6QyXrXSPqCDxFiOQ6NPSdS0QhBGYifHXe1o6UKImPDRL1rNm62lPv7NzAzj1yoKXBEq_SlEqxw2Z7_hVJRxGmRAuR8ggdbzzwyNtdtzbF-_FBoVNU2_31CRpJPU82E3_wUTVVzeNwh2WgZzJt5WFXO3m9a7-LR7SlOJEzUXTuhUbLPP7KD8PpAXKXDKMmvOmsQmd9E1nbiaDi_ckvBCfS0kcV_2ULdiwAJTUZitmG9bkaAc20-IOxO71XWi3TIUcFIZE9HiM1GTIx1PS7g_6TpsPOOFv3XjST3pDgsCXIJAkLSeMP0jXZLLWDCd8FJEYhdLQRnvuQadRb181HVuCwRG4NxMUhZ6iEVNSCu4rIb0QT7qQhVW8QU0FWemySCKIUcYiqjwWIeajknq8UoxoZR-yo3gkD4Bw1PY4DueWIuV6fsioUlWNR6igvufzPJRSPgTC5ifXZTLegnlmZTNtQVE3PW0By8PZ_JnxLDvHv9THKXsDu1OnAap_ZVS5EOXk4Tzl1qL779EOVyM_gvWyZrjxhDmGbDJ5lyeIZ5KwABnWuCngIr5-uG8V7GLG62X98ekZezvl2heoiO4o
linkProvider Springer Nature
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LTxsxEB4FOJQLj5aKAAUf6KlYJLtex3tAqC2JwiuqYJG4bb1eGxAkG0gQ8Of4bYyNNwEkuHHwxev1YTye-cb2zAewHgVK1hVav7CmDWWZiGncMIoKLpRiEiGDtvnOhx3ePmF7p9FpBR7LXBj7rLK0ic5Q54WyZ-SbCNMDhMbojbb719SyRtnb1ZJCQ3pqhXzLlRjziR37-uEOQ7jB1u4OrvfPIGg1k79t6lkGqEL1G-JujwzPhdFaydgoHWVozDORNbCDO5JUzUSu0U8bd-lnIpEjrOGaRzKs5TzEeSdgioUsxuBv6k-z8-_oRWamIwXFGMq-L2KhT9txyXv2RBZ7bbNRBRWvXeMY7765onWerzUHMx6ykt_POjYPFd37CrMlHQTx1uEbJMeOUwfNJ1HnssDRpCv7A5JcXF7QRF5KIq_OUKTD8y5BqEwQepJjmhX35MzVvrYqQmQvJwWasa7PD12Ak08R53eY7BU9vQhEYnwocTpWzw2L4kxwYxoWwXDF4yiWVaiX8kqVr2huiTWu0lEtZifjtGablXEqqvBr9E__uZ7Hh6NXymVI_d4epGNNrMJGuTTjz-_PtvTxbGvwpZ0cHqQHu539ZZgOrGa4dzMrMDm8udU_EP0Ms1WvYgT-f7ZWPwGJ5BNi
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dT8IwEG8UE-OL30YUtQ--aQNsa-keiUrwi5gACW9L17VAgI3ATPzzvZYN0KiJD33Zbn3o9e5-t_Z3h9A1daSoSvB-bkVp4oXcJ35NS8IZl9ITABmU4Tu_tliz6z31aG-NxW9vu-dHkgtOg6nSFKflaaTLS-Kb-ZsJabAZBpETvom2PFMoAXZ016mvMSNtU07IYYyk52a0mZ_n-BqaVnjz2xGpjTyNfbSbQUZcX-j4AG2o-BDt5e0YcGadR6jTtj1twH1hORAJSOOJmM5xZzgako4YCSzG_WQ2TAcTDFAVA_TDbRImH7hva08bFWERRzgBNzLJ-JnHqNt46Nw1SdY0gUiwphScF9Us4lopKXwtFQ0hNoU8rMEDZnu-Ko9HCmCHtmeYmvIIUBpTjAq3EjH3BBXiJFanCAvIzwRM51Uj7VE_5EzrmkEQTDKf-qKIqvl6BTKrKG4aW4yDZS1ku8ZBxQyzxgEvopvlN9NFPY0_pUu5GoLMtuYBJGwOJEmAS4roNlfN6vXvs539T_wKbb_dN4KXx9bzOdpxzEax11hKqJDO3tUFgJE0vLT77RO6utNd
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Selective+chaotic+maps+Tiki-Taka+algorithm+for+the+S-box+generation+and+optimization&rft.jtitle=Neural+computing+%26+applications&rft.au=Zamli%2C+Kamal+Z.&rft.au=Kader%2C+Abdul&rft.au=Din%2C+Fakhrud&rft.au=Alhadawi%2C+Hussam+S.&rft.date=2021-12-01&rft.pub=Springer+London&rft.issn=0941-0643&rft.eissn=1433-3058&rft.volume=33&rft.issue=23&rft.spage=16641&rft.epage=16658&rft_id=info:doi/10.1007%2Fs00521-021-06260-8&rft.externalDocID=10_1007_s00521_021_06260_8
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0941-0643&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0941-0643&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0941-0643&client=summon