Multi-objective optimisation of bijective s-boxes

In this paper we investigate the heuristic construction of bijective s-boxes that satisfy a wide range of cryptographic criteria including algebraic complexity, high nonlinearity, low autocorrelation and have none of the known weaknesses including linear structures, fixed points or linear redundancy. We demonstrate that the power mappings can be evolved (by iterated mutation operators alone) to generate bijective s-boxes with the best known tradeoffs among the considered criteria. The s-boxes found are suitable for use directly in modern encryption algorithms. Joanne Fuller, Ph.D.: She is a research associate at the Information Security Institute of Queensland University of Technology in Brisbane, Australia. She received her Ph.D. from out in 2004. William Millan, Ph.D.: He is a postdoctoral research fellow at the Information Security Institute of Queensland University of Technology in Brisbane, Australia. He pioneered the use of Evolutionary Computation techniques to develop new cryptographic primitives, notably new Boolean functions and S-boxes for block and stream ciphers, and has published many papers in this area. Ed Dawson, Ph.D.: He is the Director of the Information Security Institute of Queensland University of Technology in Brisbane, Australia. He has published more than 200 papers in Crypto conferences and Journals. He has served as Program Committee Member for more than 50 International Conferences in Cryptology and Network Security. He is currently a member of the Board of Directors of International Association for Cryptologic Research (IACR).