Evolutionary heuristics for finding cryptographically strong s-boxes

被引:0
作者
Millan, W [1 ]
Burnett, L [1 ]
Carter, G [1 ]
Clark, A [1 ]
Dawson, E [1 ]
机构
[1] Queensland Univ Technol, Informat Secur Res Ctr, Brisbane, Qld 4001, Australia
来源
INFORMATION AND COMMUNICATION SECURITY, PROCEEDINGS | 1999年 / 1726卷
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Recent advances are reported in the use of heuristic optimisation 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. We discuss the selection of suitable GA parameters, and in particular we 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. Our results demonstrate that assimilation provides rapid convergence to good solutions. We present an analysis comparing the relative effectiveness of including a local optimisation procedure at various stages of the CA. Our results show that these algorithms find cryptographically strong s-boxes faster than exhaustive search.
引用
收藏
页码:263 / 274
页数:12
相关论文
共 50 条
[41]   Linear redundancy in S-boxes [J].
Fuller, J ;
Millan, W .
FAST SOFTWARE ENCRYPTION, 2003, 2887 :74-86
[42]   S-boxes with controllable nonlinearity [J].
Cheon, JH ;
Chee, S ;
Park, C .
ADVANCES IN CRYPTOLOGY - EUROCRYPT'99, 1999, 1592 :286-294
[43]   A novel technique for the construction of strong S-boxes based on chaotic Lorenz systems [J].
Khan, Majid ;
Shah, Tariq ;
Mahmood, Hasan ;
Gondal, Muhammad Asif ;
Hussain, Iqtadar .
NONLINEAR DYNAMICS, 2012, 70 (03) :2303-2311
[44]   A novel technique for the construction of strong S-boxes based on chaotic Lorenz systems [J].
Majid Khan ;
Tariq Shah ;
Hasan Mahmood ;
Muhammad Asif Gondal ;
Iqtadar Hussain .
Nonlinear Dynamics, 2012, 70 :2303-2311
[45]   Generation of 8 x 8 S-boxes using 4 x 4 optimal S-boxes [J].
Tiwari, Vikas ;
Singh, Ajeet ;
Tentu, Appala Naidu ;
Saxena, Ashutosh .
INTERNATIONAL JOURNAL OF INFORMATION AND COMPUTER SECURITY, 2023, 20 (3-4) :399-413
[46]   PAIRS AND TRIPLETS OF DES S-BOXES [J].
DAVIES, D ;
MURPHY, S .
JOURNAL OF CRYPTOLOGY, 1995, 8 (01) :1-25
[47]   A Note on Rotation Symmetric S-boxes [J].
Guangpu Gao ;
Dongdai Lin ;
Wenfen Liu .
Journal of Systems Science and Complexity, 2019, 32 :1460-1472
[48]   On the nonlinearity of S-boxes and linear codes [J].
Liu, Jian ;
Mesnager, Sihem ;
Chen, Lusheng .
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2017, 9 (03) :345-361
[49]   The design of s-boxes by simulated annealing [J].
Clark, JA ;
Jacob, JL ;
Stepney, S .
NEW GENERATION COMPUTING, 2005, 23 (03) :219-231
[50]   GOOD S-BOXES ARE EASY TO FIND [J].
ADAMS, C ;
TAVARES, S .
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 435 :612-615