Abstract
In this paper basic properties of APN permutations, which can be used in an iterated secret-key block cipher as a round function to protect it from a differential cryptanalysis, are investigated. Several classes of almost perfect nonlinear permutations and other permutations in GF(2)n with good nonlinearity and high nonlinear order are presented. Included here are also three methods for constructing permutations with good nonlinearity.
Cite
CITATION STYLE
Beth, T., & Ding, C. (1994). On almost perfect nonlinear permutations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 765 LNCS, pp. 65–76). Springer Verlag. https://doi.org/10.1007/3-540-48285-7_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
