S-box optimisation using heuristic methods
Algorithms; Cryptography; Heuristic algorithms; Optimization; Redundancy; Security of data; Heuristic; Nonlinearity; Optimisations; Redundancy removal; S-box; S-boxes; Substitution boxes; Heuristic methods
Saved in:
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
Institute for Mathematical Research (INSPEM)
2023
|
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1833352261795840000 |
|---|---|
| author | Isa H. Jamil N. Z'Aba M.R. |
| author2 | 56432795500 |
| author_facet | 56432795500 Isa H. Jamil N. Z'Aba M.R. |
| author_sort | Isa H. |
| building | UNITEN Library |
| collection | Institutional Repository |
| content_provider | Universiti Tenaga Nasional |
| content_source | UNITEN Institutional Repository |
| continent | Asia |
| country | Malaysia |
| description | Algorithms; Cryptography; Heuristic algorithms; Optimization; Redundancy; Security of data; Heuristic; Nonlinearity; Optimisations; Redundancy removal; S-box; S-boxes; Substitution boxes; Heuristic methods |
| format | Conference Paper |
| id | my.uniten.dspace-22948 |
| institution | Universiti Tenaga Nasional |
| publishDate | 2023 |
| publisher | Institute for Mathematical Research (INSPEM) |
| record_format | dspace |
| spelling | my.uniten.dspace-229482023-05-29T14:13:36Z S-box optimisation using heuristic methods Isa H. Jamil N. Z'Aba M.R. 56432795500 36682671900 24726154700 Algorithms; Cryptography; Heuristic algorithms; Optimization; Redundancy; Security of data; Heuristic; Nonlinearity; Optimisations; Redundancy removal; S-box; S-boxes; Substitution boxes; Heuristic methods 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. � 2016, Institute for Mathematical Research (INSPEM). All rights reserved. Final 2023-05-29T06:13:35Z 2023-05-29T06:13:35Z 2016 Conference Paper 2-s2.0-84984604127 https://www.scopus.com/inward/record.uri?eid=2-s2.0-84984604127&partnerID=40&md5=98c657787a8ce54e3ca4e7d22b160582 https://irepository.uniten.edu.my/handle/123456789/22948 120 128 Institute for Mathematical Research (INSPEM) Scopus |
| spellingShingle | Isa H. Jamil N. Z'Aba M.R. S-box optimisation using heuristic methods |
| title | S-box optimisation using heuristic methods |
| title_full | S-box optimisation using heuristic methods |
| title_fullStr | S-box optimisation using heuristic methods |
| title_full_unstemmed | S-box optimisation using heuristic methods |
| title_short | S-box optimisation using heuristic methods |
| title_sort | s-box optimisation using heuristic methods |
| url_provider | http://dspace.uniten.edu.my/ |