Differentially uniform mappings for cryptography
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
On almost perfect nonlinear permutations
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
A characterization of binary bent functions
Journal of Combinatorial Theory Series A
A construction of bent function
FFA '95 Proceedings of the third international conference on Finite fields and applications
Journal of Combinatorial Theory Series A
Almost perfect nonlinear power functions on GF (2n): the Niho case
Information and Computation
Another Proof of Kasami‘s Theorem
Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus
Almost perfect nonlinear power functions on GF(2n): the Welch case
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Codes, graphs, and schemes from nonlinear functions
European Journal of Combinatorics
The weight distribution of a class of p-ary cyclic codes
Finite Fields and Their Applications
| Hi-index | 0.00 |
We give a construction of bentfunctions in 2n variables, here nis odd, by using maximally nonlinear functions on \GF.