Publication:
Construction of Cryptographically Strong S-Boxes Inspired by Bee Waggle Dance

Simple item page
dc.citedby32
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:11:36Z
dc.date.available2023-05-29T06:11:36Z
dc.date.issued2016
dc.descriptionCryptography; Bee Algorithm; Bee Waggle Dance; Box construction; Power functions; Substitution boxes; Heuristic methodsen_US
dc.description.abstractIn this paper, we explore a heuristic method called the bee waggle dance to construct cryptographically strong S-boxes. The S-boxes exhibit good cryptographic properties such as high nonlinearity, low differential uniformity and high algebraic degree. The method involves the use of a trinomial power function as the initial S-box. The elements in the S-box are then permuted using the bee waggle dance algorithm. The S-boxes produced using this method are found to compare reasonably well with other existing S-boxes constructed using alternative heuristic methods. To the best of our knowledge, this is the first attempt to construct cryptographically strong S-boxes using the bee waggle dance algorithm. � 2016, Ohmsha and Springer Japan.en_US
dc.description.natureFinalen_US
dc.identifier.doi10.1007/s00354-016-0302-2
dc.identifier.epage238
dc.identifier.issue3
dc.identifier.scopus2-s2.0-84981214770
dc.identifier.spage221
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84981214770&doi=10.1007%2fs00354-016-0302-2&partnerID=40&md5=38857b62e73d270876aed719567bbd88
dc.identifier.urihttps://irepository.uniten.edu.my/handle/123456789/22677
dc.identifier.volume34
dc.publisherSpringer Tokyoen_US
dc.sourceScopus
dc.sourcetitleNew Generation Computing
dc.titleConstruction of Cryptographically Strong S-Boxes Inspired by Bee Waggle Danceen_US
dc.typeArticleen_US
dspace.entity.typePublication
Files
Collections
SCOPUS