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

Herman Isa, Norziana Jamil, Muhammad Reza Z’aba

Research output: Contribution to journalArticle

8 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)221-238
Number of pages18
JournalNew Generation Computing
Volume34
Issue number3
DOIs
Publication statusPublished - 01 Aug 2016

Fingerprint

S-box
Heuristic methods
Heuristic Method
Algebraic Degree
Power Function
Uniformity
Nonlinearity
Alternatives

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Isa, Herman ; Jamil, Norziana ; Z’aba, Muhammad Reza. / Construction of Cryptographically Strong S-Boxes Inspired by Bee Waggle Dance. In: New Generation Computing. 2016 ; Vol. 34, No. 3. pp. 221-238.
@article{4a1f137e8c654a9ea0a9170a6f571a18,
title = "Construction of Cryptographically Strong S-Boxes Inspired by Bee Waggle Dance",
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.",
author = "Herman Isa and Norziana Jamil and Z’aba, {Muhammad Reza}",
year = "2016",
month = "8",
day = "1",
doi = "10.1007/s00354-016-0302-2",
language = "English",
volume = "34",
pages = "221--238",
journal = "New Generation Computing",
issn = "0288-3635",
publisher = "Springer Japan",
number = "3",

}

Construction of Cryptographically Strong S-Boxes Inspired by Bee Waggle Dance. / Isa, Herman; Jamil, Norziana; Z’aba, Muhammad Reza.

In: New Generation Computing, Vol. 34, No. 3, 01.08.2016, p. 221-238.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Isa, Herman

AU - Jamil, Norziana

AU - Z’aba, Muhammad Reza

PY - 2016/8/1

Y1 - 2016/8/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84981214770&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84981214770&partnerID=8YFLogxK

U2 - 10.1007/s00354-016-0302-2

DO - 10.1007/s00354-016-0302-2

M3 - Article

AN - SCOPUS:84981214770

VL - 34

SP - 221

EP - 238

JO - New Generation Computing

JF - New Generation Computing

SN - 0288-3635

IS - 3

ER -