Multi-objective optimisation of bijective s-boxes
Data(s) |
2005
|
---|---|
Resumo |
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. |
Identificador | |
Publicador |
Springer Japan KK |
Relação |
DOI:10.1007/BF03037655 Fuller, Joanne, Millan, William, & Dawson, Edward (2005) Multi-objective optimisation of bijective s-boxes. New Generation Computing: computing paradigms and computational intelligence, 23(3), pp. 201-218. |
Fonte |
Faculty of Science and Technology; Information Security Institute |
Palavras-Chave | #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 |
Tipo |
Journal Article |