Please use this identifier to cite or link to this item:
                
       http://dspace2020.uniten.edu.my:8080/handle/123456789/6639Full metadata record
| DC Field | Value | Language | 
|---|---|---|
| dc.contributor.author | Isa, H. | |
| dc.contributor.author | Jamil, N. | |
| dc.contributor.author | Z’aba, M.R. | |
| dc.date.accessioned | 2017-12-08T10:01:30Z | - | 
| dc.date.available | 2017-12-08T10:01:30Z | - | 
| dc.date.issued | 2016 | |
| dc.identifier.uri | http://dspace.uniten.edu.my/jspui/handle/123456789/6639 | - | 
| dc.description.abstract | In 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. | |
| dc.title | Construction of Cryptographically Strong S-Boxes Inspired by Bee Waggle Dance | |
| item.grantfulltext | none | - | 
| item.fulltext | No Fulltext | - | 
| Appears in Collections: | CCI Scholarly Publication | |
Google ScholarTM
		
		
   		    Check
	Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.