S-box optimisation using heuristic methods

Herman Isa, Norziana Jamil, Muhammad Reza Z'Aba

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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

Original languageEnglish
Title of host publicationProceedings of the 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016
EditorsHeng Swee Huay, Mohamad Rushdan Md. Said, Muhammad Rezal Kamel Ariffin, Moesfa Soeheila Mohamad, Amir Hamzah Abd Ghafar, Goi Bok Min, Hailiza Kamarulhaili
PublisherInstitute for Mathematical Research (INSPEM)
Pages120-128
Number of pages9
ISBN (Electronic)9789834406950
Publication statusPublished - 01 Jan 2016
Event5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016 - Kota Kinabalu, Sabah, Malaysia
Duration: 31 May 201602 Jun 2016

Publication series

NameProceedings of the 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016

Other

Other5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016
CountryMalaysia
CityKota Kinabalu, Sabah
Period31/05/1602/06/16

Fingerprint

Heuristic methods
Substitution reactions
Redundancy
Heuristic algorithms
Experiments

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Information Systems
  • Electrical and Electronic Engineering

Cite this

Isa, H., Jamil, N., & Z'Aba, M. R. (2016). S-box optimisation using heuristic methods. In H. S. Huay, M. R. M. Said, M. R. K. Ariffin, M. S. Mohamad, A. H. A. Ghafar, G. B. Min, & H. Kamarulhaili (Eds.), Proceedings of the 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016 (pp. 120-128). (Proceedings of the 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016). Institute for Mathematical Research (INSPEM).
Isa, Herman ; Jamil, Norziana ; Z'Aba, Muhammad Reza. / S-box optimisation using heuristic methods. Proceedings of the 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016. editor / Heng Swee Huay ; Mohamad Rushdan Md. Said ; Muhammad Rezal Kamel Ariffin ; Moesfa Soeheila Mohamad ; Amir Hamzah Abd Ghafar ; Goi Bok Min ; Hailiza Kamarulhaili. Institute for Mathematical Research (INSPEM), 2016. pp. 120-128 (Proceedings of the 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016).
@inproceedings{680277f97c9d4d5aa976534eda376e88,
title = "S-box optimisation using heuristic methods",
abstract = "Isa 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.",
author = "Herman Isa and Norziana Jamil and Z'Aba, {Muhammad Reza}",
year = "2016",
month = "1",
day = "1",
language = "English",
series = "Proceedings of the 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016",
publisher = "Institute for Mathematical Research (INSPEM)",
pages = "120--128",
editor = "Huay, {Heng Swee} and Said, {Mohamad Rushdan Md.} and Ariffin, {Muhammad Rezal Kamel} and Mohamad, {Moesfa Soeheila} and Ghafar, {Amir Hamzah Abd} and Min, {Goi Bok} and Hailiza Kamarulhaili",
booktitle = "Proceedings of the 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016",

}

Isa, H, Jamil, N & Z'Aba, MR 2016, S-box optimisation using heuristic methods. in HS Huay, MRM Said, MRK Ariffin, MS Mohamad, AHA Ghafar, GB Min & H Kamarulhaili (eds), Proceedings of the 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016. Proceedings of the 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016, Institute for Mathematical Research (INSPEM), pp. 120-128, 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016, Kota Kinabalu, Sabah, Malaysia, 31/05/16.

S-box optimisation using heuristic methods. / Isa, Herman; Jamil, Norziana; Z'Aba, Muhammad Reza.

Proceedings of the 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016. ed. / Heng Swee Huay; Mohamad Rushdan Md. Said; Muhammad Rezal Kamel Ariffin; Moesfa Soeheila Mohamad; Amir Hamzah Abd Ghafar; Goi Bok Min; Hailiza Kamarulhaili. Institute for Mathematical Research (INSPEM), 2016. p. 120-128 (Proceedings of the 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - S-box optimisation using heuristic methods

AU - Isa, Herman

AU - Jamil, Norziana

AU - Z'Aba, Muhammad Reza

PY - 2016/1/1

Y1 - 2016/1/1

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

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

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

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

M3 - Conference contribution

T3 - Proceedings of the 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016

SP - 120

EP - 128

BT - Proceedings of the 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016

A2 - Huay, Heng Swee

A2 - Said, Mohamad Rushdan Md.

A2 - Ariffin, Muhammad Rezal Kamel

A2 - Mohamad, Moesfa Soeheila

A2 - Ghafar, Amir Hamzah Abd

A2 - Min, Goi Bok

A2 - Kamarulhaili, Hailiza

PB - Institute for Mathematical Research (INSPEM)

ER -

Isa H, Jamil N, Z'Aba MR. S-box optimisation using heuristic methods. In Huay HS, Said MRM, Ariffin MRK, Mohamad MS, Ghafar AHA, Min GB, Kamarulhaili H, editors, Proceedings of the 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016. Institute for Mathematical Research (INSPEM). 2016. p. 120-128. (Proceedings of the 5th International Cryptology and Information Security Conference 2016, CRYPTOLOGY 2016).