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
Construction of bent functions via Niho power functions
Journal of Combinatorial Theory Series A
Improved fast correlation attacks using parity-check equations of weight 4 and 5
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Some new three-valued crosscorrelation functions for binary m-sequences
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
IEEE Transactions on Information Theory
Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes
IEEE Transactions on Information Theory
Recursive Lower Bounds on the Nonlinearity Profile of Boolean Functions and Their Applications
IEEE Transactions on Information Theory
Information Sciences: an International Journal
On the lower bounds of the second order nonlinearities of some Boolean functions
Information Sciences: an International Journal
A Lower Bound of the Second-order Nonlinearities of Boolean Bent Functions
Fundamenta Informaticae
On Second-order Nonlinearities of Some D 0 Type Bent Functions
Fundamenta Informaticae - Cryptology in Progress: 10th Central European Conference on Cryptology, Będlewo Poland, 2010
On the second-order nonlinearities of some bent functions
Information Sciences: an International Journal
Hi-index | 0.08 |
The rth order nonlinearity of Boolean functions is an important cryptographic criterion associated with some attacks on stream and block ciphers. It is also very useful in coding theory, since it is related to the covering radii of Reed-Muller codes. This paper tightens the lower bounds of the second order nonlinearity of three classes of Boolean functions in the form f(x)=tr(x^d) in n variables, where (1) d=2^m^+^1+3 and n=2m, or (2) d=2^m+2^m^+^1^2+1, n=2m and m is odd, or (3) d=2^2^r+2^r^+^1+1 and n=4r.