Publication:
S-box optimisation using heuristic methods

Simple item page
dc.contributor.authorIsa H.en_US
dc.contributor.authorJamil N.en_US
dc.contributor.authorZ'Aba M.R.en_US
dc.contributor.authorid56432795500en_US
dc.contributor.authorid36682671900en_US
dc.contributor.authorid24726154700en_US
dc.date.accessioned2023-05-29T06:13:35Z
dc.date.available2023-05-29T06:13:35Z
dc.date.issued2016
dc.descriptionAlgorithms; Cryptography; Heuristic algorithms; Optimization; Redundancy; Security of data; Heuristic; Nonlinearity; Optimisations; Redundancy removal; S-box; S-boxes; Substitution boxes; Heuristic methodsen_US
dc.description.abstractIsa et al. (2013, 2016) proposed two heuristic algorithms (redundancy removal and bee waggle dance) to construct cryptographically strong substitution boxes (S-boxes). The resulting S-boxes produced by these algorithms are suitable for cryptographic use. Inspired by their work, this paper explores a new method to optimise an S-box by integrating these two algorithms. Our experiments show that at least three cryptographically strong S-boxes can be produced by the new method. The results also improves upon a previous construction by Mamadolimov et al. (2013) which utilises the redundancy removal algorithm. � 2016, Institute for Mathematical Research (INSPEM). All rights reserved.en_US
dc.description.natureFinalen_US
dc.identifier.epage128
dc.identifier.scopus2-s2.0-84984604127
dc.identifier.spage120
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84984604127&partnerID=40&md5=98c657787a8ce54e3ca4e7d22b160582
dc.identifier.urihttps://irepository.uniten.edu.my/handle/123456789/22948
dc.publisherInstitute for Mathematical Research (INSPEM)en_US
dc.sourceScopus
dc.sourcetitleProceedings of the 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016
dc.titleS-box optimisation using heuristic methodsen_US
dc.typeConference Paperen_US
dspace.entity.typePublication
Files
Collections
SCOPUS