zbMATH — the first resource for mathematics

Evolutionary heuristics for finding cryptographically strong S-boxes. (English) Zbl 1014.94556
Varadharajan, Vijay (ed.) et al., Information and communication security. 2nd international conference, ICICS ’99, Sydney, Australia, November 9-11, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1726, 263-274 (1999).
Summary: Recent advances are reported in the use of heuristic optimization for the design of cryptographic mappings. The genetic algorithm (GA) is adapted for the design of regular substitution boxes (S-boxes) with relatively high nonlinearity and low autocorrelation. The authors discuss the selection of suitable GA parameters, and in particular they introduce an effective technique for breeding S-boxes. This assimilation operation produces a new S-box which is a simple and natural compromise between the properties of two dissimilar parent S-boxes. These results demonstrate that assimilation provides rapid convergence to good solutions. The authors also present an analysis comparing the relative effectiveness of including a local optimization procedure at various stages of the GA. The results show that these algorithms find cryptographically strong S-boxes faster than exhaustive search.
For the entire collection see [Zbl 0931.00051].

94A60 Cryptography