Please use this identifier to cite or link to this item: http://dspace2020.uniten.edu.my:8080/handle/123456789/6640
Full metadata record
DC FieldValueLanguage
dc.contributor.authorIsa, H.
dc.contributor.authorJamil, N.
dc.contributor.authorZ'Aba, M.R.
dc.date.accessioned2017-12-08T10:01:31Z-
dc.date.available2017-12-08T10:01:31Z-
dc.date.issued2016
dc.identifier.urihttp://dspace.uniten.edu.my/jspui/handle/123456789/6640-
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.
dc.titleS-box optimisation using heuristic methods
item.grantfulltextnone-
item.fulltextNo Fulltext-
Appears in Collections:CCI Scholarly Publication
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.