Finite field for scientists and engineers
Finite field for scientists and engineers
Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Shift Register Sequences
On the Randomness of Legendre and Jacobi Sequences
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Cryptanalysis of Block Ciphers with Probabilistic Non-linear Relations of Low Degree
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
The Interpolation Attack on Block Ciphers
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Trace representation of Legendre sequences of Mersenne prime period
IEEE Transactions on Information Theory - Part 2
On the linear complexity of Legendre sequences
IEEE Transactions on Information Theory
Transform domain analysis of DES
IEEE Transactions on Information Theory
Theory and applications of q-ary interleaved sequences
IEEE Transactions on Information Theory
Further Results Related to Generalized Nonlinearity
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
A note on character sums with polynomial arguments
Finite Fields and Their Applications
| Hi-index | 0.00 |
Cryptographic Boolean functions should have large distance to functions with simple algebraic description to avoid cryptanalytic attacks based on successive approximation of the round function such as the interpolation attack. Hyper-bent functions achieve the maximal minimum distance to all the coordinate functions of all bijective monomials. However, this class of functions exists only for functions with even number of inputs. In this paper we provide some constructions for Boolean functions with odd number of inputs that achieve large distance to all the coordinate functions of all bijective monomials.