Cryptanalysis of DES with a reduced number of rounds
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Non-linearity of exponent permutations
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Differentially uniform mappings for cryptography
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Differential Cryptanalysis of DES-like Cryptosystems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Provable Security Against Differential Cryptanalysis
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Markov ciphers and differential cryptanalysis
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Maximally Nonlinear Functions and Bent Functions
Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus
State of the Art in Applied Cryptography, Course on Computer Security and Industrial Cryptography - Revised Lectures
A New Characterization of Almost Bent Functions
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Cartesian authentication codes from functions with optimal nonlinearity
Theoretical Computer Science
Journal of Complexity - Special issue on coding and cryptography
Designs, Codes and Cryptography
The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Note: APN permutations on Zn and Costas arrays
Discrete Applied Mathematics
On the covering structures of two classes of linear codes from perfect nonlinear functions
IEEE Transactions on Information Theory
S-boxes with controllable nonlinearity
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Permutation polynomials EA-equivalent to the inverse function over GF (2n)
Cryptography and Communications
A complete formulation of generalized affine equivalence
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
A new criterion for nonlinearity of block ciphers
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
Block ciphers sensitive to gröbner basis attacks
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
Results on rotation-symmetric S-boxes
Information Sciences: an International Journal
The affinity of a permutation of a finite vector space
Finite Fields and Their Applications
A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree
Finite Fields and Their Applications
The Carlitz rank of permutations of finite fields: A survey
Journal of Symbolic Computation
| Hi-index | 0.06 |
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.