Finite field for scientists and engineers
Finite field for scientists and engineers
Nonlinearity criteria for cryptographic functions
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Two new classes of bent functions
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
A construction of bent function
FFA '95 Proceedings of the third international conference on Finite fields and applications
Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems
Designs, Codes and Cryptography
Shift Register Sequences
Nonlinearity Bounds and Constructions of Resilient Boolean Functions
CRYPTO '00 Proceedings of the 20th 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
Probabilistic Higher Order Differential Attack and Higher Order Bent Functions
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
The Interpolation Attack on Block Ciphers
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
On Cryptographically Secure Vectorial Boolean Functions
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
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
Sequences, DFT and Resistance against Fast Algebraic Attacks
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
A New Family of Hyper-Bent Boolean Functions in Polynomial Form
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Quadratic Equations from a Kind of S-boxes
Information Security Applications
Hyper-bent Boolean functions with multiple trace terms
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
A new class of bent and hyper-bent Boolean functions in polynomial forms
Designs, Codes and Cryptography
On exact algebraic [non-]immunity of s-boxes based on power functions
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
A note on character sums with polynomial arguments
Finite Fields and Their Applications
On multiple output bent functions
Information Processing Letters
Dickson polynomials, hyperelliptic curves and hyper-bent functions
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
| Hi-index | 0.00 |
Bent functions have maximal minimum distance to the set of affine functions. In other words, they achieve the maximal minimum distance to all the coordinate functions of affine monomials. In this paper we introduce a new class of bent functions which we call hyper-bent functions. Functions within this class achieve the maximal minimum distance to all the coordinate functions of all bijective monomials. We provide an explicit construction for such functions. We also extend our results to vectorial hyper-bent functions.