ISSN 1000-1239 CN 11-1777/TP

Journal of Computer Research and Development ›› 2020, Vol. 57 ›› Issue (7): 1415-1423.doi: 10.7544/issn1000-1239.2020.20190537

Previous Articles     Next Articles

A New Automatic Search Method for Cryptographic S-Box

Zhang Runlian1,2, Sun Yaping1, Wei Yongzhuang1, Li Yingxin1   

  1. 1(Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin, Guangxi 541004);2(Guangxi Colleges Key Laboratory of Cloud Computing and Complex Systems (Guilin University of Electronic Technology), Guilin, Guangxi 541004)
  • Online:2020-07-01
  • Supported by: 
    This work was supported by the National Natural Science Foundation of China (61572148, 61872103), the Guangxi Innovation Research Team Project (2019GXNSFGA245004), the Key Research and Development Program of Guangxi (guike AB18281019), the Natural Science Foundation of Guangxi Autonomous Region of China (2018GXNSFAA294036), the Project of Guangxi Key Laboratory of Cryptography and Information Security (GCIS201705), the Project of Guangxi Colleges Key Laboratory of Cloud Computing and Complex Systems (YF16205), and the Innovation Project of Guangxi Graduate Education (YCSW2018138, YCBZ2018051).

Abstract: The cryptographic S-boxes are core component in too many symmetric encryption algorithms, which usually determine the security strength of these algorithms. The secure evaluation indicators for these cryptographic S-boxes contain balancedness, algebraic degree, nonlinearity, and differential uniformity etc. How to design the cryptographic S-boxes that have some robust abilities (indicators) against both the traditional attacks and the side channel attacks such as power attacks appears to be a rather difficult task. Currently, the automatic search tools, such as CA(cellular automata), neural network, etc, have became the research hotspots regarding to the design of the cryptographic S-box, except to the classical algebraic construction. Based on the CA rules, a new search method for S-box is proposed, which uses the strategy of partial fixed and separate searching for the variable components. More specifically, in the first place, the features of CA rules of this method is described. Moreover, the strategy of partial fixed and separate searching for the variable components according to the properties of cryptographic S-boxes is constructed. Finally, some new S-boxes are achieved and their features of these S-boxes are also evaluated. It is shown that too many 4×4 optimal S-boxes are attained. In particular, three classes of 4×4 sub-optimal S-boxes can also be transformed to some 4×4 optimal S-boxes under the CA rules of this method. Compared with the previous well-known results, these new 4×4 optimal S-boxes have lower transparency order so that they have a robuster ability against side channel attacks.

Key words: S-box, cellular automata, transparency order (TO), channel attacks, automatic search

CLC Number: