Effective method for the design of S-Boxes satisfying the strict avalanche criterion(SAC)

The strict avalanche criterion(SAC)is one of the most important cryptographic criteria for substitution boxes(S-boxes)used in many symmetric encryption systems.However,there are few constructive methods for S-boxes fulfilling the SAC until now.In this paper,to construct S-boxes satisfying the SAC directly,we generalize the concatenation techniques of Boolean functions to S-boxes.Using the idea of concatenating small variable S-boxes,we present a simple yet effective construction method of S-boxes satisfying the SAC.Finally,a simple example on how to construct SAC S-boxes with large input variables by small variables SAC S-boxes is given.

S-box:six-dimensional compound hyperchaotic map and artificial bee colony algorithm

Being as unique nonlinear components of block ciphers,substitution boxes（S-boxes） directly affect the security of the cryptographic systems.It is important and difficult to design cryptographically strong S-boxes that simultaneously meet with multiple cryptographic criteria such as bijection,non-linearity,strict avalanche criterion（SAC）,bits independence criterion（BIC）,differential probability（DP） and linear probability（LP）.To deal with this problem,a chaotic S-box based on the artificial bee colony algorithm（CSABC） is designed.It uses the S-boxes generated by the six-dimensional compound hyperchaotic map as the initial individuals and employs ABC to improve their performance.In addition,it considers the nonlinearity and differential uniformity as the fitness functions.A series of experiments have been conducted to compare multiple cryptographic criteria of this algorithm with other algorithms.Simulation results show that the new algorithm has cryptographically strong S-box while meeting multiple cryptographic criteria.