Skip to main content
Article thumbnail
Location of Repository

Multi-objective optimisation of bijective s-boxes

By Joanne Fuller, William Millan and Edward Dawson


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

Topics: 080100 ARTIFICIAL INTELLIGENCE AND IMAGE PROCESSING, 080108 Neural Evolutionary and Fuzzy Computation, 080202 Applied Discrete Mathematics, 080300 COMPUTER SOFTWARE, 170200 COGNITIVE SCIENCE, Boolean Functions, Nonlinearity, Evolutionary Computation, Equivalence Classes
Publisher: Springer Japan KK
Year: 2005
DOI identifier: 10.1007/BF03037655
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.