A novel heuristic method for obtaining S-boxes

Guo Chen

Chaos, Solitons & Fractals, 2008, vol. 36, issue 4, 1028-1036

Abstract: An efficient algorithm named chaotic multi-swapping and simulated annealing (CMSSA) for obtaining cryptographically strong 8×8 S-boxes is presented. The method is based on chaotic maps and simulated annealing. In addition, cryptographic properties such as bijectivity, strict avalanche criterion, nonlinearity, output bits independence criterion and equiprobable input/output XOR distribution are analyzed in detail for the S-box produced. The results of numerical analysis show that the box has nearly fulfilled the criteria for a cryptographically strong S-box and can effectively resist several attacks.

Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077906007405
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:36:y:2008:i:4:p:1028-1036

DOI: 10.1016/j.chaos.2006.08.003

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().