Journal
NEW GENERATION COMPUTING
Volume 23, Issue 3, Pages 201-218Publisher
SPRINGER
DOI: 10.1007/BF03037655
Keywords
crypytography; bijective s-boxes; nonlinearity; auto correlation; linear redundancy; finite field; heuristic construction
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available