Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Propagation characteristics of Boolean functions
EUROCRYPT '90 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
Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems
Designs, Codes and Cryptography
ICICS '99 Proceedings of the Second International Conference on Information and Communication Security
On Propagation Characteristics of Resilient Functions
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Cryptographic Functions and Design Criteria for Block Ciphers
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Propagation characteristics and correlation-immunity of highly nonlinear boolean functions
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
The weights of the orthogonals of the extended quadratic binary Goppa codes
IEEE Transactions on Information Theory
On cryptographic properties of the cosets of R(1, m)
IEEE Transactions on Information Theory
Modifications of Patterson-Wiedemann functions for cryptographic applications
IEEE Transactions on Information Theory
Niho type cross-correlation functions via dickson polynomials and Kloosterman sums
IEEE Transactions on Information Theory
On the Connection between Kloosterman Sums and Elliptic Curves
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Designs, Codes and Cryptography
Permutation polynomials EA-equivalent to the inverse function over GF (2n)
Cryptography and Communications
Kloosterman sum identities and low-weight codewords in a cyclic code with two zeros
Finite Fields and Their Applications
On ternary Kloosterman sums modulo 12
Finite Fields and Their Applications
On divisibility of exponential sums of polynomials of special type over fields of characteristic 2
Designs, Codes and Cryptography
| Hi-index | 0.00 |
We study the inverse permutation @s:x@?x^-^1 on the field of order 2^n by means of their component functions f"@l. We prove that the weights of derivatives of f"@l can be expressed in terms of Kloosterman sums. We are then able to compute some indicators of the propagation characteristics of @s. We can claim that @s, which is considered as a good cryptographic mapping regarding several criteria, is moreover such that the functions f"@l have good propagation properties with respect to these indicators. We further deduce several new formulas on Kloosterman sums, by using classical formulas which link any Boolean function with its derivatives.