Next Article in Journal
Poincaré Map for Discontinuous Fractional Differential Equations
Previous Article in Journal
Special Fractional-Order Map and Its Realization
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Resiliency and Nonlinearity Profiles of Some Cryptographic Functions

1
Department of Mathematics and Statistics, Central University of Punjab, Bathinda 151401, India
2
Department of Mathematics, Central University of Jammu, Jammu 181143, India
3
Department of Mathematics, Guru Nanak Dev University, Amritsar 143005, India
4
Department of Computer Science and IT, Central University of Jammu, Jammu 181143, India
5
Department of Mathematics and Computer Science, Trnava University, 91843 Trnava, Slovakia
6
Department of Media and Educational Informatics, Faculty of Informatics, Eötvös Loránd University, 1053 Budapest, Hungary
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(23), 4473; https://doi.org/10.3390/math10234473
Submission received: 27 October 2022 / Revised: 17 November 2022 / Accepted: 22 November 2022 / Published: 27 November 2022
(This article belongs to the Section Mathematics and Computer Science)

Abstract

:
Boolean functions are important in terms of their cryptographic and combinatorial properties for different kinds of cryptosystems. The nonlinearity and resiliency of cryptographic functions are crucial criteria with respect to protection of ciphers from affine approximation and correlation attacks. In this article, some constructions of disjoint spectra Boolean that function by concatenating the functions on a lesser number of variables are provided. The nonlinearity and resiliency profiles of the constructed functions are obtained. From the profiles of the constructed functions, it is observed that the nonlinearity of these functions is greater than or equal to the nonlinearity of some existing functions. Furthermore, in the security analysis of cryptosystems, 4th order nonlinearity of Boolean functions play a crucial role. It provides protection against various higher order approximation attacks. The lower bounds on 4th order nonlinearity of some classes of Boolean functions having degree 5 are provided. The lower bounds of two classes of functions have form T r 1 n ( λ x d ) for all x F 2 n , λ F 2 n * , where (i) d = 2 i + 2 j + 2 k + 2 + 1 , where i , j , k , are integers such that i > j > k > 1 and n > 2 i , and (ii) d = 2 4 + 2 3 + 2 2 + 2 + 1 , where > 0 is an integer with property gcd ( , n ) = 1 , n > 8 are provided. The obtained lower bounds are compared with some existing results available in the literature.

1. Introduction

Boolean functions are useful in designing various cryptosystems. Boolean functions on n unknowns are functions from F 2 n to F 2 , where F 2 n is an nth degree extension of F 2 .
Suppose B n is collection of Boolean functions in n unknowns, and | B n | = 2 2 n is the cardinality of B n . Boolean functions have several applications in different types of cryptosystems. The functions used in various cryptosystems should possess some cryptographic criteria such as high nonlinearity, balancedness, high resiliency, low crosscorrelation, high algebraic immunity, and high higher order (rth-order) nonlinearity. It is not possible to optimize all criteria simultaneously, but there are some trade-offs among them. Almost all the cryptographic criteria of Boolean functions can be analyzed by using the Walsh–Hadamard transform (WHT). The WHT of f B n is W f ( b ) = u F 2 n ( 1 ) f ( u ) + b · u at b F 2 n . The nonlinearity is one of the important cryptographic properties of Boolean functions. The nonlinearity of f B n is the minimum Hamming distance of function from all n-variable affine functions. The nonlinearity of f B n is defined by n l ( f ) = 2 n 1 1 2 max a F 2 n | W f ( a ) | . The functions with maximum possible nonlinearity are called bent functions [1] and are the most resistant to the affine approximation attack [2,3].
The Boolean functions possessing good cryptographic properties are useful in the design of a secure cryptosystem. The Boolean functions which are highly nonlinear, resilient, correlation immune, balanced, with low cross-correlation, and having high higher order nonlinearity are eligible to provide protection against different kinds of cryptographic attacks. However, all of these properties can not be optimized simultaneously. However, some trade-off can be obtained among them. The researchers have analysed several classes of Boolean functions by considering some cryptographic criteria listed above. The resiliency and the nonlinearity are two important cryptographic properties for Boolean functions used in various cryptosystems. High resiliency provides protection against correlation attacks [4,5,6], whereas high nonlinearity helps to prevent the ciphers from linear cryptanalysis [7] and best affine approximation attacks [2,7]. A balanced function with high nonlinearity is considered to be a good candidate for various cryptographic applications. Such functions are used as combiner functions in LSFR (linear feedback shift register) based stream ciphers. For Boolean functions to be instrumental in cryptography, they must be balanced. The balancedness is presupposition of the resilient functions along with correlation immunity. Therefore, it is important to construct resilient functions having high nonlinearity. Several constructions of resilient functions satisfying some other important cryptographic criteria have been reported in the literature [2,4,5,6,7]. Sarkar-Maitra [8], Maitra-Pasalic [9] and Zhang-Xiao [10] have constructed some resilient function having high nonlinearity. For more study on constructions of resilient functions and their properties, we refer to [8,9,10,11,12,13,14]. Gao et al. [15] have provided a technique to construct resilient Boolean functions having high nonlinearity. Singh [16] have presented some classes of resilient functions which show good behavior with respect to nonlinearity profile. The Boolean functions were employed as the nonlinear combiner/filters in different stream ciphers required to bear both good nonlinearity and resiliency properties. Resiliency put a check for the system to verify that it is not prone towards correlation attacks. To enhance security against different linear cryptanalysis and higher order approximation attacks, there is a strong need to obtain functions which are resilient and have good nonlinearity profiles. The present article is an attempt in this direction. The article presents construction of some resilient functions with high nonlinearity. Moreover, two classes of Boolean functions with higher order (in particular, 4th order) nonlinearity are presented to enhance the security of the cryptosystems from higher order approximation attacks.
The rth order nonlinearity and nonlinearity profile is a generalization of a criterion of nonlinearity [3,17]. The rth order nonlinearity n l r ( f ) of a Boolean function f is given as the minimum Hamming distance of f to the functions of degree less than or equal to r (for r = 1, it becomes a nonlinearity of f). The concept of rth order nonlinearity is used in cryptoanalysis in [2,3,18]. Due to its deep relationship with Reed–Muller codes, it also has equal importance in coding theory. Computation of higher order nonlinearities for r > 1 is an important problem. There is no efficient method to obtain the higher order nonlinearities for r > 1 . The most efficient algorithm is due to [19] which works up to n = 11 and r = 2 , and for some functions n 13 . Therefore, it is crucial to obtain theoretically lower bounds for higher order nonlinearities of functions which are true for all values of n . During the last few years, this problem has received attention from the researchers, and some interesting results have been produced. In 2008, Carlet has produced a remarkable work. He has introduced a recursive approach for computing lower bounds on higher order nonlinearities [17]. Using the Carlet’s recursive approach, Sun Wu [20] and Gode Gangopadhyay [21] have presented good lower bounds on higher order nonlinearities for various classes of Boolean functions. Recently, Singh and Paul [22] have presented lower bounds on n l 4 for a particular class of functions of the form T r 1 n ( λ x s ) , λ F 2 n * ,   s = 2 2 t 2 t + 1 and g c d ( n , t ) = 1 , t = 4 . The higher order nonlinearity plays a crucial role to analyze the security of the cryptosystems with respect to higher order approximation attacks. Motivated through this, two classes of Boolean functions are identified which possess high 4th order nonlinearity.
The organization of the article is as follows: Section 2 provides some existing results required to derive the results in this article. In Section 3, some constructions of disjoint spectra Boolean functions by concatenating functions on a lesser number of variables are provided. The nonlinearity and resiliency profiles of the constructed functions are obtained. From the profiles of the constructed functions, it is observed that the nonlinearity of these functions is greater than or equal to the nonlinearity obtained for the functions presented in [15,16]. Section 4 provides the lower bounds on 4th order nonlinearity, and some classes of functions in B n of degree 5 are obtained. The bounds for the functions having form T r 1 n ( λ x d ) for all x F 2 n , λ F 2 n * , where (i) d = 2 i + 2 j + 2 k + 2 + 1 , where i , j , k , are integers such that i > j > k > 1 and n > 2 i , and (ii) d = 2 4 + 2 3 + 2 2 + 2 + 1 , where > 0 is an integer with gcd ( , n ) = 1 and n > 8 is provided.

2. Preliminaries

This section presents some definitions and existing results required for further computation in the paper. The Hamming weight of f B n is w t ( f ) = | s u p p ( f ) | . The Hamming distance between functions h and k in B n is given by d ( h , k ) = | { x F 2 n : h ( x ) k ( x ) } | . There are various representations of Boolean functions used in coding theory and cryptography. The most common representation is the algebraic normal form (ANF) defined as f ( x 1 , x 2 , , x n ) = I { 1 , 2 , , n } a I i I x i , with a I F 2 , and i I x i is called monomial. The largest degree of the monomial with nonzero coefficient in ANF is called its algebraic degree of f .
A function ϕ B n is plateaued if, for every u F 2 n , H ϕ ( u ) { 0 , ± 2 k } , k N . Two functions ϕ and ψ in B n satisfying the property H ϕ ( α ) H ψ ( α ) = 0 for all α F 2 n are called disjoint spectra functions. A function ϕ B n is called balanced if H ϕ ( 0 ) = 0 . If H ϕ ( α ) = 0 for every α F 2 n with 1 w t ( α ) r , then ϕ is a correlation immune Boolean function of order r . A correlation immune function of order r which is balanced is known as an r-resilient function.
The following result is due to Iwata and Kurosawa [3], which provide nonlinearity of a function in terms of nonlinearities of its subfunctions.
Lemma 1
([3]). Suppose ϕ 0 and ϕ 1 are restriction functions of ϕ B n to the linear hyperplane x n = 0 and x n = 1 , respectively. Then, the functions ϕ 0 and ϕ 1 are Boolean functions on ( n 1 ) variables and satisfy the relation
n l r ( ϕ ) n l r ( ϕ 0 ) + n l r ( ϕ 1 ) .
For the construction of disjoint spectra functions, there is a concatenation of Boolean functions on less number of variables [23]. Suppose ϕ 1 and ϕ 2 are two Boolean functions on n-variables. Then, the concatenation ϕ = ϕ 1 ϕ 2 of ϕ 1 and ϕ 2 is an ( n + 1 ) -variable function expressed by
ϕ ( α n + 1 , , α 1 ) = ( 1 + α n + 1 ) ϕ 1 ( α n , , α 1 ) + α n + 1 ϕ 2 ( α n , , α 1 ) .
The profile of a Boolean function is represented by using 4-tupple ( p , q , r , s ) , where p represents number of variables, q resiliency order, r the algebraic degree, and s the nonlinearity of the selected function.
Sarkar and Maitra [8] have obtained the profile of a concatenated function on ( n + 1 ) variables in terms of the profile of its subfunction on n variables.
Lemma 2
([8]). Suppose the profile of the function ϕ B n is ( n , r , n r 1 , n l ) and ϕ ¯ is the complement function of ϕ. Then, the profile of ϕ ϕ ¯ is given by ( n + 1 , r + 1 , n r 1 , 2 n l ) .
Siegenthaler [24] has provided the following relationship on resiliency of function obtained by the concatenation of two functions.
Lemma 3
([24]). If ϕ 1 and ϕ 2 , are two r-resilient functions, then the function ϕ = ϕ 1 ϕ 2 is also r-resilient.
Let v = ( v s , , v 1 ) and ϕ B n . The restriction function of ϕ with respect to v is defined as
ϕ v ( α n s , , α 1 ) = ϕ ( α n = v s , , α n s + 1 = v 1 , α n s , , α 1 ) .
Suppose u = ( u s , , u 1 ) F 2 s and α = ( α n s , , α 1 ) F 2 n s . Then, the vector concatenation of u and α is defined as
u α = ( u , α ) = ( u s , , u 1 , α n s , , α 1 ) .
Definition 1.
The spectrum characterization matrix S M ( ϕ ) of ϕ B n is a matrix whose rows are the vectors of F 2 n at which the WHS values of ϕ are non-zero, i.e.,
S M ( ϕ ) = { α F 2 n : H ϕ ( α ) 0 } .
Furthermore, if u is a string of some fixed length, then we denote the matrix { u α : α S M ( ϕ ) } by u S M ( ϕ ) .
Gao et al. [15] have provided a relationship between the WHT of function ϕ and its subfunctions. Using this result, they have constructed highly nonlinear resilient Boolean functions.
Lemma 4
([15], Theorem 1). Suppose ϕ B n , u = ( u s , , u 1 ) F 2 s and α = ( α n s , , α 1 ) F 2 n s . Then, the WHT of ϕ in terms of its subfunction is given by
H ϕ ( u α ) = y F 2 s H ϕ y ( α ) ( 1 ) u , y .
For any subfield F 2 t of F 2 n ( obviously t | n ) , the function defined by T r t n ( x ) = x + x 2 t + x 2 2 t + + x 2 ( n 1 ) t is called trace function. For t = 1 , the function T r 1 n : F 2 n F 2 defined by T r 1 n ( x ) = x + x 2 + x 2 2 + + x 2 n 1 is called absolute trace function [25].
The derivative  D a f ( x ) of a function f in B n at a F 2 n is given as D a f ( x ) = f ( x + a ) + f ( x ) for all x F 2 n . Suppose U is a q-dimensional subspace in F 2 n generated using b 1 , , b q , that is, U = b 1 , , b q . The qth order derivative of f in B n with respect to U is defined as D U f ( x ) = D b 1 D b q f ( x ) , for every x F 2 n . The bilinear form of f is given as B ( x , y ) = f ( x ) + f ( y ) + f ( 0 ) + f ( x + y ) . E f = { x F 2 n : B ( x , y ) = 0 for every y F 2 n } is a subspace of F 2 n and known as kernel of B ( x , y ) .
The following two results are due to Carlet [17], which are frequently used to draw lower bounds on rth order nonlinearities of functions.
Proposition 1
([17]). Let f B n and 0 < r < n , an integer. Then, n l r ( f ) 1 2 max a F 2 n n l r 1 ( D a f ) . In terms of higher-order derivatives, for all non negative i < r ,
n l r ( f ) 1 2 i max a 1 , a 2 , , a i F 2 n n l r i ( D a 1 , D a 2 D a i f ) .
Proposition 2
([17]). Let h B n and 0 < r < n , an integer. Then,
n l r ( h ) 2 n 1 1 2 2 2 n 2 b F 2 n n l r 1 ( D b h ) .
In terms of a higher-order derivative, for every positive integer < r ,
n l r ( h ) 2 n 1 1 2 a 1 F 2 n a 2 F 2 n 2 2 n 2 a F 2 n n l r 1 ( D a 1 D a h ) .
Proposition 3
([26]). Suppose L ( x ) = i = 0 v c i x 2 i k is a linearized polynomial in F 2 n , where v , k are positive integers with gcd ( n , k ) = 1 . Then, the zeros of the linearized polynomial in F 2 n are at most 2 v .
Proposition 4
([25]). Let f be a quadratic function with its bilinear form as B ( x , y ) . Then, the weight distribution of spectrum of WHT of the function f is related to only dimension t of E f of the bilinear form B ( x , y ) .
W f ( α ) Number of α
0 2 n 2 n t
2 ( n + t ) / 2 2 n t 1 + ( 1 ) f ( 0 ) 2 ( n t 2 ) / 2
2 ( n + t ) / 2 2 n t 1 ( 1 ) f ( 0 ) 2 ( n t 2 ) / 2

3. Computation of Disjoint Spectra Resilient Functions Having Good Nonlinearity

The following theorem presents the construction of disjoint spectra Boolean functions on n + 4 variables by using disjoint spectra functions on n variables.
Theorem 1.
Let ϕ 0 , ψ 0 B n be optimal plateaued resilient Boolean functions having disjoint spectra. Define the functions ϕ = ( x n + 1 + 1 ) ϕ 0 + x n + 1 ψ 0 ,   ψ = x n + 1 + ϕ 0 and κ = x n + 1 + ψ 0 . Then, Φ = ϕ ¯ ϕ ϕ ϕ ¯ ϕ ϕ ¯ ϕ ¯ ϕ and Ψ = ψ ¯ κ ¯ κ ψ κ ¯ ψ ¯ ψ κ are also disjoint spectra functions on F 2 n + 4 .
Proof. 
Since ϕ 0 and ψ 0 are disjoint spectra functions, therefore, from a definition, it follows that H ϕ 0 ( α ) H ψ 0 ( α ) = 0 for every α F 2 n . It is easy to verify that H ϕ ( α ) = H ϕ ¯ ( α ) . Now, if α S M ( ϕ 0 ) or S M ( ψ 0 ) , then, by using Lemma 4, we obtain the Walsh–Hadamard transform of the function ϕ as
H ϕ ( 0 α ) = x F 2 H ϕ x ( α ) ( 1 ) 0 · x = H ϕ 0 ( α ) + H ϕ 1 ( α ) = H ϕ 0 ( α ) + H ψ 0 ( α ) 0 [ a s ϕ = ϕ 0 ψ 0 ] ,
and
H ϕ ( 1 α ) = x F 2 H ϕ x ( α ) ( 1 ) 1 · x = H ϕ 0 ( α ) H ϕ 1 ( α ) = H ϕ 0 ( α ) H ψ 0 ( α ) 0 [ a s ϕ = ϕ 0 ψ 0 ] .
According to Definition 1, the spectrum characterization matrix of ϕ is a matrix whose rows are those vectors of F 2 n + 1 for which WHT values of ϕ are nonzero. Therefore, on combining (1), (2), and Definition 1, the spectrum characterization matrix of ϕ is given by
S M ( ϕ ) = 0 S M ( ϕ 0 ) 1 S M ( ϕ 0 ) 0 S M ( ψ 0 ) 1 S M ( ψ 0 ) .
In order to obtain the spectrum characterization matrix of function Φ = ϕ ¯ ϕ ϕ ϕ ¯ ϕ ϕ ¯ ϕ ¯ ϕ , the WHT values of Φ are required. By using Lemma 4, the WHT values of Φ in terms its subfunctions are given by
H Φ ( u , α ) = y F 2 3 H ϕ y ( α ) ( 1 ) u . y .
Taking u = 111 , we obtain
H Φ ( 111 α ) = H ϕ 000 ( α ) + H ϕ 001 ( α ) H ϕ 010 ( α ) + H ϕ 011 ( α ) H ϕ 100 ( α ) + H ϕ 101 ( α ) + H ϕ 110 ( α ) H ϕ 111 ( α ) = H ϕ 1 ( α ) H ϕ 2 ( α ) H ϕ 3 ( α ) + H ϕ 4 ( α ) H ϕ 5 ( α ) + H ϕ 6 ( α ) + H ϕ 7 ( α ) H ϕ 8 ( α )
H Φ ( 111 α ) = H ϕ ¯ ( α ) H ϕ ( α ) H ϕ ( α ) + H ϕ ¯ ( α ) H ϕ ( α ) + H ϕ ¯ ( α ) + H ϕ ¯ ( α ) H ϕ ( α ) = H ϕ ( α ) H ϕ ( α ) H ϕ ( α ) H ϕ ( α ) H ϕ ( α ) H ϕ ( α ) H ϕ ( α ) H ϕ ( α ) = 8 H ϕ ( α ) .
Similarly, we can obtain the WHT of Φ at other values of u as
H Φ ( 110 α ) = 0 , H Φ ( 101 α ) = 0 , H Φ ( 100 α ) = 0 , H Φ ( 011 α ) = 0 , H Φ ( 010 α ) = 0 , H Φ ( 001 α ) = 0 , H Φ ( 000 α ) = 0 .
Now, by combining (3), (4), and Definition 1, the spectrum characterization matrix of Φ is given by
S M ( Φ ) = 111 S M ( ϕ ) = 1110 S M ( ϕ 0 ) 1111 S M ( ϕ 0 ) 1110 S M ( ψ 0 ) 1111 S M ( ψ 0 ) .
Again, by using Lemma 4, the WHT values for the concatenated function Ψ = ψ ¯ κ ¯ κ ψ κ ¯ ψ ¯ ψ κ are given as H Ψ ( 000 α ) = 0 , H Ψ ( 001 α ) = 0 , H Ψ ( 010 α ) = 4 H ψ ( α ) 4 H κ ( α ) , H Ψ ( 011 α ) = 0 , H Ψ ( 100 α ) = 0 , H Ψ ( 101 α ) = 4 H ψ ( α ) + 4 H κ ( α ) , H Ψ ( 110 α ) = 0 , H Ψ ( 111 α ) = 0 .
Therefore, the spectrum characterization matrix of ψ , κ and Ψ are given by
S M ( ψ ) = 1 S M ( ϕ 0 ) , S M ( κ ) = 1 S M ( ψ 0 ) , and
S M ( Ψ ) = 010 S M ( ψ ) 101 S M ( ψ ) 010 S M ( κ ) 101 S M ( κ ) = 0101 S M ( ϕ 0 ) 1011 S M ( ϕ 0 ) 0101 S M ( ψ 0 ) 1011 S M ( ψ 0 ) .
From the spectrum characterization matrix of concatenated functions Φ and Ψ , it is observed that Φ and Ψ are disjoint spectra Boolean functions on F 2 n + 4 . □
In the following result, we obtain the profiles for the functions Φ and Ψ as constructed in Theorem 1. We investigate the resiliency order and the nonlinearities of the constructed functions Φ and Ψ , and show that the disjoint spectra functions Φ and Ψ are highly nonlinear and resilient on F 2 n + 4 .
Theorem 2.
Suppose ϕ 0 , ψ 0 B n are two optimal plateaued resilient functions of disjoint spectra having profile ( n , r , n r 1 , 2 n 1 2 r + 1 ) , and ϕ , ψ , κ are the functions as in Theorem 1. Then, the functions Φ and Ψ are disjoint spectra resilient functions with good nonlinearity having profile ( n + 4 , r + 3 , n r , 2 n + 3 2 r + 4 ) and ( n + 4 , r + 2 , n r , 2 n + 3 2 r + 4 ) , respectively.
Proof. 
We have ϕ = ϕ 0 ψ 0 ; by Lemmas 2 and 3, it follows that the function ϕ ¯ ϕ is an ( r + 1 ) -resilient function and nonlinearity of ϕ ¯ ϕ is n l ( ϕ ¯ ϕ ) = 2 n l ( ϕ ) . Suppose P = ϕ ¯ ϕ ϕ ϕ ¯ . Then, in the view of Lemma 4, for any α F 2 n , the WHT values of the function P are obtained as H P ( 00 α ) = 0 , H P ( 01 α ) = 0 , H P ( 10 α ) = 0 , H P ( 11 α ) = 4 H ϕ ( α ) .
Clearly, when w t ( 11 α ) r + 2 , then w t ( α ) r and ϕ is an r-resilient Boolean function; this implies H ϕ ( α ) = 0 , and therefore H P ( 11 α ) = 0 . Hence, resiliency order of P is ( r + 2 ) . In addition, by using Lemma 1, we obtain the nonlinearity n l ( P ) = 4 n l ( ϕ ) .
Now, for the function Φ = ϕ ¯ ϕ ϕ ϕ ¯ ϕ ϕ ¯ ϕ ¯ ϕ , using Lemma 4, we obtain
H Φ ( 000 α ) = 0 , H Φ ( 001 α ) = 0 , H Φ ( 010 α ) = 0 , H Φ ( 011 α ) = 0 ,
H Φ ( 100 α ) = 0 , H Φ ( 101 α ) = 0 , H Φ ( 110 α ) = 0 , H Φ ( 111 α ) = 8 H ϕ ( α ) .
If w t ( 111 α ) r + 3 , then clearly w t ( α ) r . Now, ϕ is r-resilient function; therefore, H Φ ( 111 α ) = 0 , which implies Φ is an ( r + 3 ) -resilient Boolean function on F 2 n + 4 .
From the profile of the function ϕ , it is clear that max α F 2 n + 1 | H ϕ ( α ) | = 2 r + 2 , and the spectrum of Φ shows that max u F 2 3 , α F 2 n + 1 | H Φ ( u , α ) | = 8 max α F 2 n + 1 | H ϕ ( α ) | = 2 3 . 2 r + 2 = 2 r + 5 . Therefore, the nonlinearity of Φ is given by n l ( Φ ) = 2 n + 3 2 r + 4 . Hence, the profile of Φ is ( n + 4 , r + 3 , n r , 2 n + 3 2 r + 4 ) .
From the definition of the functions, ψ = ϕ 0 ¯ ϕ 0 , κ = ψ 0 ¯ ψ 0 and Lemma 2, the profile of the functions ψ and κ is obtained as ( n + 1 , r + 1 , n r 1 , 2 n 2 r + 2 ) . Now, on interchanging the position of the variables x n + 1 and x n + 2 in the function ψ ¯ κ ¯ = ϕ 0 ¯ ϕ 0 ψ 0 ¯ ψ 0 , we obtain the function ϕ 0 ¯ ψ 0 ¯ ϕ 0 ψ 0 , which is the same as the function concatenation ϕ ¯ ϕ . Using Lemma 2, we obtain the nonlinearity n l ( ψ ¯ κ ¯ ) = 2 n l ϕ .
Now, take Q = ψ ¯ κ ¯ κ ψ . By using Lemma 4, we obtain H Q ( 00 α ) = 0 , H Q ( 01 α ) = 2 H ψ ( α ) + 2 H κ ( α ) , H Q ( 10 α ) = 2 H ψ ( α ) 2 H κ ( α ) , H Q ( 11 α ) = 0 . Now, if w t ( 01 α ) , w t ( 10 α ) r + 2 , then obviously w t ( α ) r + 1 . Now, both ψ and κ are ( r + 1 ) -resilient; therefore, H ψ ( α ) = 0 , H κ ( α ) = 0 , and hence we obtain H Q ( 01 α ) = 0 , H Q ( 10 α ) = 0 . Thus, the order of resiliency of the function Q is ( r + 2 ) . Furthermore, the nonlinearity of Q is n l ( Q ) = 2 n l ( ψ ¯ κ ¯ ) = 4 n l ( ϕ ) .
Now, consider the function Ψ = ψ ¯ κ ¯ κ ψ κ ¯ ψ ¯ ψ κ . Using Lemma 4, we obtain H Ψ ( 000 α ) = 0 , H Ψ ( 001 α ) = 0 , H Ψ ( 010 α ) = 4 H ψ ( α ) 4 H κ ( α ) , H Ψ ( 100 α ) = 0 , H Ψ ( 011 α ) = 0 , H Ψ ( 101 α ) = 4 H ψ ( α ) + 4 H κ ( α ) , H Ψ ( 110 α ) = 0 , H Ψ ( 111 α ) = 0 . Furthermore, w t ( 010 α ) ( r + 2 ) implies that w t ( α ) r + 1 . Since resiliency order of both ψ and κ is ( r + 1 ) , therefore H ψ ( α ) = 0 , H κ ( α ) = 0 , from which it follows that H Ψ ( 010 α ) = 0 , H Ψ ( 101 α ) = 0 . Therefore, the resiliency order of Ψ is r + 2 .
From the profile of the functions ψ and κ , it is clear that m a x α F 2 n + 1 { | H ψ ( α ) | , | H κ ( α ) | } = 2 r + 3 . In addition, ψ and κ are functions of disjoint spectra; thus, from the Walsh–Hadamard spectrum of Ψ , we obtain max u F 2 3 , α F 2 n + 1 | H Ψ ( u , α ) | = 4 max α F 2 n + 1 { | H ψ ( α ) | , | H κ ( α ) | } = 2 r + 5 . Hence, the nonlinearity of Ψ is n l ( Ψ ) = 2 n + 3 2 r + 4 . Therefore, the profile of Ψ is ( n + 4 , r + 2 , n r , 2 n + 3 2 r + 4 ) .
From spectrum characterization matrices and the constructions of the concatenated functions Φ and Ψ , it is clear that they are disjoint spectra plateaued resilient functions having good nonlinearity with profiles ( n + 4 , r + 3 , n r , 2 n + 3 2 r + 4 ) and ( n + 4 , r + 2 , n r , 2 n + 3 2 r + 4 ) , respectively. □
In the following result, another pair of concatenated functions is constructed. It is proved that the constructed functions are highly nonlinear resilient and have disjoint spectra. By analyzing the nonlinearity and resiliency of the constructed functions, their profiles are obtained.
Theorem 3.
Suppose ϕ 0 , ψ 0 B n are two optimal plateaued resilient functions of disjoint spectra having profile ( n , r , n r 1 , 2 n 1 2 r + 1 ) , and ϕ , ψ , κ are the functions as in Theorem 1. Then, the functions Φ = ϕ ¯ ϕ ¯ ϕ ϕ ϕ ϕ ¯ ϕ ϕ ¯ and Ψ = ψ κ κ ψ ψ ¯ κ ¯ κ ¯ ψ ¯ , are disjoint spectra resilient functions with good nonlinearity having profiles ( n + 4 , r + 1 , n r , 2 n + 3 2 r + 3 ) and ( n + 4 , r + 2 , n r , 2 n + 3 2 r + 4 ) , respectively.
Proof. 
We have Φ = ϕ ¯ ϕ ¯ ϕ ϕ ϕ ϕ ¯ ϕ ϕ ¯ and Ψ = ψ κ κ ψ ψ ¯ κ ¯ κ ¯ ψ ¯ . By using Lemma 4, the Walsh–Hadamard transform values of concatenated function Φ are given as follows:
H Φ ( 000 α ) = 0 , H Φ ( 001 α ) = 4 H ϕ ( α ) , H Φ ( 010 α ) = 4 H ϕ ( α ) , H Φ ( 011 α ) = 0 , H Φ ( 100 α ) = 0 , H Φ ( 101 α ) = 4 H ϕ ( α ) , H Φ ( 110 α ) = 4 H ϕ ( α ) , H Φ ( 111 α ) = 0 ,
and the Walsh–Hadamard transform values of concatenated function Ψ are obtained as
H Ψ ( 000 α ) = 0 , H Ψ ( 001 α ) = 4 H κ ( α ) , H Ψ ( 010 α ) = 0 , H Ψ ( 011 α ) = 4 H κ ( α ) , H Ψ ( 100 α ) = 0 , H Ψ ( 101 α ) = 4 H ψ ( α ) , H Ψ ( 110 α ) = 0 , H Ψ ( 111 α ) = 4 H ψ ( α ) .
The remaining computation is similar to the computation made in Theorem 1 and Theorem 2. In view of (5), (6), and Definition 1, the spectrum characterization matrix of Φ is obtained as follows:
S M ( Φ ) = 001 S M ( ϕ ) 010 S M ( ϕ ) 101 S M ( ϕ ) 110 S M ( ϕ ) = 0010 S M ( ϕ 0 ) 0011 S M ( ϕ 0 ) 0100 S M ( ϕ 0 ) 0101 S M ( ϕ 0 ) 1010 S M ( ϕ 0 ) 1011 S M ( ϕ 0 ) 1100 S M ( ϕ 0 ) 1101 S M ( ϕ 0 ) 0010 S M ( ψ 0 ) 0011 S M ( ψ 0 ) 0100 S M ( ψ 0 ) 0101 S M ( ψ 0 ) 1010 S M ( ψ 0 ) 1011 S M ( ψ 0 ) 1100 S M ( ψ 0 ) 1101 S M ( ψ 0 ) ,
and the spectrum characterization matrix of Ψ is given by
S M ( Ψ ) = 100 S M ( ψ ) 111 S M ( ψ ) 100 S M ( κ ) 111 S M ( κ ) = 1001 S M ( ϕ 0 ) 1111 S M ( ϕ 0 ) 1001 S M ( ψ 0 ) 1111 S M ( ψ 0 ) .
The matrices S M ( Φ ) and S M ( Ψ ) show that the concatenated functions Φ and Ψ have disjoint spectra. In addition, the profiles of Φ and Ψ are ( n + 4 , r + 1 , n r , 2 n + 3 2 r + 3 ) and ( n + 4 , r + 2 , n r , 2 n + 3 2 r + 4 ) , respectively. Here, it can be noted that the nonlinearity of the constructed function Φ is efficiently high, which can be verified graphically from Figure 1 and numerically from Table 1. □

4. Lower Bounds for Fourth Order Nonlinearities of Two Classes of Monomial Functions Having Degree 5

This section provides lower bounds for 4th order nonlinearities of two classes of monomial functions having degree 5.
Theorem 4.
Let f λ ( x ) = T r 1 n ( λ x 2 i + 2 j + 2 k + 2 + 1 ) , for all x F 2 n , where λ F 2 n * , and i , j , k and ℓ are integer with i > j > k > 1 and n > 2 i . Then,
n l 4 ( f λ ) 2 n 4 2 n + 2 i 8 2 f o r n 0 mod 2 2 n 4 2 n + 2 i 9 2 f o r n 1 mod 2 .
In particular, if gcd ( n , j k ) = 1 and gcd ( n , k ) = 1 , then
n l 4 ( f λ ) 2 n 1 1 4 ( 2 n 1 ) ( 2 n 2 ) 2 3 n + 2 i 2 3 ( 2 n 2 n + 2 i 2 ) 1 / 2 f o r n 0 mod 2 2 n 1 1 4 ( 2 n 1 ) ( 2 n 2 ) 2 3 n + 2 i 1 2 3 ( 2 n 2 n + 2 i 1 2 ) 1 / 2 f o r n 1 mod 2 .
Proof. 
The first order derivative D a f λ of f λ at a in F 2 n * is given as
D a f λ ( x ) = f λ ( x + a ) + f λ ( x ) = T r 1 n ( λ ( x + a ) 2 i + 2 j + 2 k + 2 + 1 ) + T r 1 n ( λ x 2 i + 2 j + 2 k + 2 + 1 ) = T r 1 n ( λ ( a x 2 i + 2 j + 2 k + 2 + a 2 i x 2 j + 2 k + 2 + 1 + a 2 j x 2 i + 2 k + 2 + 1 + a 2 k x 2 i + 2 j + 2 + 1 + a 2 x 2 i + 2 j + 2 k + 1 ) ) + c ( x ) ,
where c ( x ) is cubic function. Now, the second order derivative D b D a f λ of f λ at b in F 2 n * ( b a ) is
D b D a f λ ( x ) = f λ ( x + a + b ) + f λ ( x + b ) + f λ ( x + a ) + f λ ( x ) = T r 1 n [ λ ( ( a b 2 + b a 2 ) x 2 i + 2 j + 2 k + ( a b 2 i + b a 2 i ) x 2 j + 2 k + 2 + ( a b 2 j + b a 2 j ) x 2 j + 2 k + 2 + ( a b 2 k + b a 2 k ) x 2 i + 2 j + 2 + ( a 2 k b 2 + a 2 b 2 k ) x 2 i + 2 j + 1 + ( a 2 j b 2 + a 2 b 2 j ) x 2 i + 2 k + 1 + ( a 2 j b 2 k + a 2 k b 2 j ) x 2 i + 2 + 1 + ( a 2 i b 2 + a 2 b 2 i ) x 2 j + 2 k + 1 + ( a 2 i b 2 k + a 2 k b 2 i ) x 2 j + 2 + 1 + ( a 2 i b 2 j + a 2 j b 2 i ) x 2 k + 2 + 1 ) ] + Q ( x )
where Q ( x ) is a quadratic function.
The third order derivative D c D b D a f λ of f λ at c F 2 n * ( a c , b c ) is given as
D c ( D b D a f λ ( x ) ) = f λ ( x + a + b + c ) + f λ ( x + a + b ) + f λ ( x + a + c ) + f λ ( x + a ) + f λ ( x + b + c ) + f λ ( x + b ) + f λ ( x + c ) + f λ ( x ) = h λ ( x ) + l ( x ) ,
where l ( x ) is affine.
Since D c ( D b D a f λ ) is quadratic, therefore WHS of D c ( D b D a f λ ) is equivalent to the WHS of h λ ( x ) , where
h λ ( x ) = T r 1 n [ λ ( ( a b 2 c 2 k + b a 2 c 2 k + a b 2 k c 2 + b a 2 k c 2 + a 2 k b 2 c + a 2 b 2 k c ) x 2 i + 2 j + ( a b 2 c 2 j + b a 2 c 2 j + a b 2 j c 2 + b a 2 j c 2 + a 2 j b 2 c + a 2 b 2 j c ) x 2 i + 2 k + ( a b 2 j c 2 k + a 2 j b c 2 k + a b 2 k c 2 j + a 2 k b c 2 j + a 2 j b 2 k c + a 2 k b 2 j c ) x 2 i + 2 + ( a b 2 c 2 i + a 2 b c 2 i + a b 2 i c 2 + a 2 i b c 2 + a 2 i b 2 c + a 2 b 2 i c ) x 2 j + 2 k + ( a b 2 k c 2 i + a 2 k b c 2 i + a b 2 i c 2 k + a 2 i b c 2 k + a 2 i b 2 k c + a 2 k b 2 i c ) x 2 j + 2 + ( a b 2 i c 2 j + a 2 i b c 2 j + a b 2 j c 2 i + a 2 j b c 2 i + a 2 i b 2 j c + a 2 j b 2 i c ) x 2 k + 2 + ( a 2 k b 2 c 2 j + a 2 b 2 k c 2 j + a 2 j b 2 c 2 k + a 2 b 2 j c 2 k + a 2 j b 2 k c 2 + a 2 k b 2 j c 2 ) x 2 i + 1 + ( a 2 k b 2 c 2 i + a 2 b 2 k c 2 i + a 2 i b 2 c 2 k + a 2 b 2 i c 2 k + a 2 i b 2 k c 2 + a 2 k b 2 i c 2 ) x 2 j + 1 + ( a 2 j b 2 c 2 i + a 2 b 2 j c 2 i + a 2 i b 2 c 2 j + a 2 b 2 i c 2 j + a 2 i b 2 j c 2 + a 2 j b 2 i c 2 ) x 2 k + 1 + ( a 2 j b 2 k c 2 i + a 2 k b 2 j c 2 i + a 2 i b 2 k c 2 j + a 2 k b 2 i c 2 j + a 2 i b 2 j c 2 k + a 2 j b 2 i c 2 k ) x 2 + 1 ) ]
Let E h λ = { x F 2 n : B ( x , y ) = 0 for every y F 2 n } , where B ( x , y ) for h λ is
B ( x , y ) = h λ ( 0 ) + h λ ( y ) + h λ ( x ) + h λ ( x + y ) = T r 1 n [ λ ( y 2 i { R 1 x 2 j + R 2 x 2 k + R 3 x 2 + R 7 x } + y 2 j { R 1 x 2 i + R 4 x 2 k + R 5 x 2 + R 8 x } + y k { R 2 x 2 i + R 4 x 2 j + R 6 x 2 + R 9 x } + y 2 { R 3 x 2 i + R 5 x 2 j + R 6 x 2 k + R 10 x } + y { R 7 x 2 i + R 8 x 2 j + R 9 x 2 k + R 10 x 2 } ) ] = T r 1 n ( y P ( x ) ) ,
where the coefficients of different powers of x in the above expression are denoted by R 1 , R 2 , , R 10 and given as follows:
R 1 = a b 2 c 2 k + b a 2 c 2 k + a b 2 k c 2 + b a 2 k c 2 + a 2 k b 2 c + a 2 b 2 k c R 2 = a b 2 c 2 j + b a 2 c 2 j + a b 2 j c 2 + b a 2 j c 2 + a 2 j b 2 c + a 2 b 2 j c R 3 = a b 2 j c 2 k + a 2 j b c 2 k + a b 2 k c 2 j + a 2 k b c 2 j + a 2 j b 2 k c + a 2 k b 2 j c R 4 = a b 2 c 2 i + a 2 b c 2 i + a b 2 i c 2 + a 2 i b c 2 + a 2 i b 2 c + a 2 b 2 i c R 5 = a b 2 k c 2 i + a 2 k b c 2 i + a b 2 i c 2 k + a 2 i b c 2 k + a 2 i b 2 k c + a 2 k b 2 i c R 6 = a b 2 i c 2 j + a 2 i b c 2 j + a b 2 j c 2 i + a 2 j b c 2 i + a 2 i b 2 j c + a 2 j b 2 i c R 7 = a 2 k b 2 c 2 j + a 2 b 2 k c 2 j + a 2 j b 2 c 2 k + a 2 b 2 j c 2 k + a 2 j b 2 k c 2 + a 2 k b 2 j c 2 R 8 = a 2 k b 2 c 2 i + a 2 b 2 k c 2 i + a 2 i b 2 c 2 k + a 2 b 2 i c 2 k + a 2 i b 2 k c 2 + a 2 k b 2 i c 2 R 9 = a 2 j b 2 c 2 i + a 2 b 2 j c 2 i + a 2 i b 2 c 2 j + a 2 b 2 i c 2 j + a 2 i b 2 j c 2 + a 2 j b 2 i c 2 R 10 = a 2 j b 2 k c 2 i + a 2 k b 2 j c 2 i + a 2 i b 2 k c 2 j + a 2 k b 2 i c 2 j + a 2 i b 2 j c 2 k + a 2 j b 2 i c 2 k ,
and the polynomial P ( x ) is given as
P ( x ) = ( λ R 1 x 2 j + λ R 2 x 2 k + λ R 3 x 2 + λ R 7 x ) 2 n i + ( λ R 1 x 2 i + λ R 4 x 2 k + λ R 5 x 2 + λ R 8 x ) 2 n j + ( λ R 2 x 2 i + λ R 4 x 2 j + λ R 6 x 2 + λ R 9 x ) 2 n k + ( λ R 3 x 2 i + λ R 5 x 2 j + λ R 6 x 2 k + λ R 10 x ) 2 n + ( λ R 7 x 2 i + λ R 8 x 2 j + λ R 9 x 2 k + R 10 x 2 ) .
Let L λ ( x ) = ( P ( x ) ) 2 i . Then, the polynomial L λ ( x ) becomes
L λ ( x ) = λ ( R 1 x 2 j + R 2 x 2 k + R 3 x 2 + R 7 x ) + λ 2 i j [ R 1 2 i j x 2 2 i j + R 4 2 i j x 2 i + k j + R 5 2 i j x 2 i + j + R 8 2 i j x 2 i j ] + λ 2 i k [ R 2 2 i k x 2 2 i k + R 4 2 i k x 2 i + j k + R 6 2 i k x 2 i + k + R 9 2 i k x 2 i k ] + λ 2 i [ R 3 2 i x 2 2 i + R 5 2 i x 2 i + j + R 6 2 i x 2 i + k + R 10 2 i x 2 i ] + λ 2 i [ R 7 2 i x 2 2 i + R 8 2 i x 2 i + j + R 9 2 i x 2 i + k + R 10 2 i x 2 i + ]
From L λ ( x ) , in (7), the coefficient of x is zero if and only if R 7 = 0 , i.e., if and only if a 2 k b 2 c 2 j + a 2 b 2 k c 2 j + a 2 j b 2 c 2 k + a 2 b 2 j c 2 k + a 2 j b 2 k c 2 + a 2 k b 2 j c 2 = 0 . If a = 1 , then b 2 c 2 j + b 2 k c 2 j + b 2 c 2 k + b 2 j c 2 k + b 2 k c 2 + b 2 j c 2 = 0 implies that b F 2 k and c F 2 k . Thus, if a = 1 , b F 2 k and c F 2 k , the degree of polynomial L λ ( x ) in x is at most 2 2 i . Hence, k ( 1 , b , c ) 2 i for even n and k ( 1 , b , c ) 2 i 1 otherwise.
The Walsh–Hadamard transform of D c ( D b D a f λ ) at μ F 2 n is
W D c ( D b D a f λ ) ( μ ) 2 n + 2 i 2 for n 0 mod 2 2 n + 2 i 1 2 for n 1 mod 2 .
Therefore, by using the value of W D c ( D b D a f λ ) ( μ ) , we obtain the nonlinearity of the function D c ( D b D a f λ ) as
n l ( D c ( D b D a f λ ) ) = 2 n 1 1 2 max μ F 2 n | W D c ( D b D a f λ ) ( μ ) | 1 2 2 n · 2 n + 2 i 2 for n 0 mod 2 1 2 2 n 1 2 · 2 n + 2 i 1 2 for n 1 mod 2 .
From (8) and Proposition 1, we obtain 4th order nonlinearity of f λ as
n l 4 ( f λ ) 1 2 3 max a , b , c F 2 n n l ( D c ( D b D a f λ ) ) 2 n 4 2 n + 2 i 8 2 for n 0 mod 2 2 n 4 2 n + 2 i 9 2 for n 1 mod 2 .
In particular, if gcd ( j k , n ) = 1 and gcd ( k , n ) = 1 , then, by using Proposition 2, the improved 4th order nonlinearity of f λ is obtained as
  • when n 0 mod 2
    n l 4 ( f λ ) 2 n 1 1 4 ( 2 n 1 ) ( 2 n 2 ) 2 2 n 2 ( 2 n 3 ) ( 2 n 1 2 n + 2 i 2 2 ) = 2 n 1 1 4 ( 2 n 1 ) ( 2 n 2 ) 2 3 n + 2 i 2 3 ( 2 n 2 n + 2 i 2 ) 1 / 2 .
  • when n 1 mod 2
    n l 4 ( f λ ) 2 n 1 1 4 ( 2 n 1 ) ( 2 n 2 ) 2 2 n 2 ( 2 n 3 ) ( 2 n 1 2 n + 2 i 3 2 ) = 2 n 1 1 4 ( 2 n 1 ) ( 2 n 2 ) 2 3 n + 2 i 1 2 3 ( 2 n 2 n + 2 i 1 2 ) 1 / 2 .
and hence the result. □
Theorem 5.
Let g λ ( x ) = T r 1 n ( λ x 2 4 + 2 3 + 2 2 + 2 + 1 ) for all x F 2 n , where λ F 2 n * and ℓ is a positive integer with gcd ( n , ) = 1 and n > 8 . Then,
n l 4 ( g λ ) 2 n 1 1 4 ( 2 n 1 ) ( 2 n 2 ) 2 3 n + 8 2 3 ( 2 n 2 n + 8 2 ) 1 / 2 i f n 0 mod 2 2 n 1 1 4 ( 2 n 1 ) ( 2 n 2 ) 2 3 n + 7 2 3 ( 2 n 2 n + 7 2 ) 1 / 2 i f n 1 mod 2 .
Proof. 
The proof is identical to Theorem 4 except the case i = 4 , j = 3 , k = 2 , = . Therefore, L λ ( x ) is obtained by replacing i , j and k by 4 , 3 and 2 , respectively, in (7).
L λ ( x ) = λ ( R 1 x 2 3 + R 2 x 2 2 + R 3 x 2 + R 7 x ) + λ 2 [ R 1 2 x 2 5 + R 4 2 x 2 3 + R 5 2 x 2 2 + R 8 2 x 2 ] + λ 2 2 [ R 2 2 2 x 2 6 + R 4 2 2 x 2 5 + R 6 2 2 x 2 3 + R 9 2 2 x 2 2 ] + λ 2 3 [ R 3 2 3 x 2 7 + R 5 2 3 x 2 6 + R 6 2 3 x 2 5 + R 10 2 3 x 2 3 ] + λ 2 4 [ R 7 2 4 x 2 8 + R 8 2 4 x 2 7 + R 9 2 4 x 2 6 + R 10 2 4 x 2 5 ] = x 2 6 [ λ 2 2 R 2 2 2 + λ 2 3 R 3 2 3 + λ 2 4 R 9 2 4 ] + x 2 5 [ λ 2 R 1 2 + λ 2 2 R 4 2 2 + λ 2 3 R 6 2 3 + λ 2 4 R 10 2 4 ] + x 2 3 [ λ R 1 + λ 2 R 1 2 + λ 2 2 R 6 2 2 + λ 2 3 R 10 2 3 ] + x 2 2 [ λ R 2 + λ 2 R 5 2 + λ 2 2 R 9 2 2 ] + x 2 [ λ R 3 + λ 2 2 R 8 2 ] + x [ λ R 7 ] + x 2 8 [ λ 2 4 R 7 2 4 ] + x 2 7 [ λ 2 3 R 3 2 3 + λ 2 4 R 8 2 4 ]
Now, the coefficient of x is zero if and only if R 7 = 0 , i.e., if and only if a 2 2 b 2 3 c 2 3 + a 2 2 b 2 2 c 2 2 + a 2 3 b 2 c 2 2 + a 2 b 2 3 c 2 2 + a 2 3 b 2 2 c 2 2 + a 2 2 b 2 3 c 2 2 = 0 . If a = 1 , then b 2 2 c 2 3 + b 2 2 c 2 + b 2 c 2 2 + b 2 3 c 2 2 + b 2 2 c 2 + b 2 3 c 2 = 0 . If b 2 2 = b , then b F 2 2 . Therefore, b 2 2 = b implies that c 2 2 = 0 , i.e., c F 2 2 . If a = 1 , b F 2 2 and c F 2 2 , then the degree of L λ ( x ) is atmost 2 8 . This implies k ( 1 , b , c ) 8 for even n and k ( 1 , b , c ) 7 otherwise.
The Walsh–Hadamard transform of D c ( D b D a g λ ) at μ F 2 n is
W D c ( D b D a g λ ) ( μ ) 2 n + 8 2 for n 0 mod 2 2 n + 7 2 for n 1 mod 2 .
Therefore, the nonlinearity of D c ( D b D a g λ ) is
n l ( D c ( D b D a g λ ) ) = 2 n 1 2 n + 6 2 for n 0 mod 2 2 n 1 2 n + 5 2 for n 1 mod 2 .
From (9) and Proposition 1, the 4th order nonlinearity of function g λ is obtained as
n l 4 ( g λ ) 1 2 3 max a , b , c F 2 n n l ( D c ( D b D a g λ ) ) 2 n 4 2 n 2 for n 0 mod 2 2 n 4 2 n 1 2 for n 1 mod 2 .
Now, by using Proposition 2 and (10), the improved 4th order nonlinearity of g λ is given by
  • when n 0 mod 2
    n l 4 ( g λ ) 2 n 1 1 4 ( 2 n 1 ) ( 2 n 2 ) 2 2 n 2 ( 2 n 3 ) ( 2 n 1 2 n + 6 2 ) 2 n 1 1 4 ( 2 n 1 ) ( 2 n 2 ) 2 3 n + 8 2 3 ( 2 n 2 n + 8 2 ) 1 / 2 .
  • when n 1 mod 2
    n l 4 ( g λ ) 2 n 1 1 4 ( 2 n 1 ) ( 2 n 2 ) 2 2 n 2 ( 2 n 3 ) ( 2 n 1 2 n + 5 2 ) 2 n 1 1 4 ( 2 n 1 ) ( 2 n 2 ) 2 3 n + 7 2 3 ( 2 n 2 n + 7 2 ) 1 / 2 .
and hence the result. □

5. Comparison

This section presents a numerical comparison of the results obtained in this article with the existing results. The nonlinearity of the function Φ constructed in Theorem 3 is 2 n + 3 2 r + 3 , which is greater than the nonlinearity 2 n + 3 2 r + 4 of the functions F and G given in [15], Theorem 3. Furthermore, the nonlinearity of the function Ψ constructed in Theorem 3, and the nonlinearity of the functions Φ and Ψ constructed in Theorem 2 is the same as the nonlinearity of the functions given in [16], Theorem 3. The results are demonstrated numerically in Table 1 and graphically in Figure 1.
Table 2 and Figure 2 present a comparison of lower bounds obtained in Theorem 4 for i = 4 , 5 , 6 with the general bounds on 4th order nonlinearity for Boolean functions of degree 5, i.e., n l 4 ( f ) 2 n 5 [17], since the formula for computation of bounds on 4th order nonlinearity is developed in terms of the integer i. In view of the condition i > j > k > l 1 on the integers i , j , k , l , the smallest value that i can assume is 4. From Table 2 and Figure 2, it is clear that the bounds obtained in Theorem 4 for i = 4 , 5 , 6 are efficiently large as compared to Carlet’s general bounds [17].
Furthermore, Table 3 and Figure 3 provide a comparison of bounds obtained in Theorem 5 with the lower bounds for inverse function [17], general bounds [17], and the bounds due to Iwata-Kurosawa [3]. It is noted that the bounds in Theorem 5 are better than the bounds presented for above-mentioned classes of functions.

6. Conclusions

The nonlinearity and resiliency of cryptographic functions are crucial criteria with respect to protection of ciphers from affine approximation and correlation attacks. The article presents some constructions of disjoint spectra Boolean functions by concatenating functions on a lesser number of variables are provided. The nonlinearity and resiliency profiles of the constructed functions are analyzed. After analyzing the profiles of the constructed functions, it is observed that the nonlinearity of these functions is greater than (in the case of some functions) or the same as the nonlinearity obtained by Gao et al. [15] and Singh [16].
Furthermore, the higher order nonlinearity is instrumental in providing protection towards higher order approximation attacks. Therefore, identifying functions possessing higher order nonlinearity (in particular, 4th order nonlinearity) is a paramount research problem. It is evident from Table 2 that the bounds on 4th order nonlinearity obtained in Theorem 4 for i = 4 , 5 , 6 are efficiently large as compared to Carlet’s general bounds [17]. Furthermore, Table 3 shows that the lower bounds obtained in Theorem 5 are better than the bounds obtained for inverse function [17], general bounds [17], and the bounds due to Iwata–Kurosawa [3].
On the basis of the properties satisfied by the functions presented in this article, it is expected that the results of this article will play an important role in analyzing security of cryptosystems with respect to linear cryptanalysis, affine approximation attacks, and higher order approximation attacks.
The good nonlinearity profile is predominant in ensuring the security of the cryptosystems. Along with the nonlinearity profile, it is considered equally important if the constructed functions owns properties of other cryptographic primitives such as balancedness, algebraic immunity, correlation immunity, algebraic degree, etc. In future work, our aim is to construct some more cryptographic functions with increased nonlinearity profiles that satisfy other cryptographic primitives.

Author Contributions

Conceptualization, D.S., A.P., N.K., V.S. and C.V.; methodology, D.S., A.P. and N.K.; software, D.S., A.P. and N.K.; validation, D.S., A.P., N.K., V.S. and C.V.; formal analysis, D.S. and A.P.; investigation, D.S. and A.P.; resources, D.S., A.P., N.K., V.S. and C.V.; data curation, D.S., A.P. and N.K.; writing—original draft preparation, D.S., A.P., N.K., V.S. and C.V.; writing—review and editing, D.S., A.P., N.K., V.S. and C.V.; visualization, D.S., A.P. and N.K.; supervision, D.S. and N.K.; project administration, D.S. and V.S.; funding acquisition, V.S. and C.V. All authors have read and agreed to the published version of the manuscript.

Funding

The paper was supported by the National Project of the Slovakia Ministry of Education: KEGA 013TTU-4/2021 “Interactive animation and simulation models for deep learning”.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The first author is thankful to the Central University of Punjab for providing research seed money Grant No: CUPB/Acad./2022/1194 and to NBHM-DAE for providing financial support under Grant No.-02011/10/2020 NBHM(R.P.) /R&D II/7025. The first author is also thankful to Narinder Verma, a Research Scholar at the Central University of Jammu for his support in drawing the graphs.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Rothaus, O. On “bent” functions. J. Comb. Theory Ser. 1976, 20, 300–305. [Google Scholar] [CrossRef] [Green Version]
  2. Golić, J.D. Fast Low Order Approximation of Cryptographic Functions. In Proceedings of the Advances in Cryptology—EUROCRYPT ’96; Maurer, U., Ed.; Springer: Berlin/Heidelberg, Germany, 1996; pp. 268–282. [Google Scholar]
  3. Iwata, T.; Kurosawa, K. Probabilistic Higher Order Differential Attack and Higher Order Bent Functions. In Proceedings of the Advances in Cryptology—ASIACRYPT ’99; Lam, K.Y., Okamoto, E., Xing, C., Eds.; Springer: Berlin/Heidelberg, Germany, 1999; pp. 62–74. [Google Scholar]
  4. Courtois, N.T. Higher Order Correlation Attacks, XL Algorithm and Cryptanalysis of Toyocrypt. In Proceedings of the Information Security and Cryptology—ICISC 2002; Lee, P.J., Lim, C.H., Eds.; Springer: Berlin/Heidelberg, Germany, 2003; pp. 182–199. [Google Scholar]
  5. Palit, S.; Roy, B.K.; De, A. A Fast Correlation Attack for LFSR-Based Stream Ciphers. In Proceedings of the Applied Cryptography and Network Security; Zhou, J., Yung, M., Han, Y., Eds.; Springer: Berlin/Heidelberg, Germany, 2003; pp. 331–342. [Google Scholar]
  6. Siegenthaler. Decrypting a Class of Stream Ciphers Using Ciphertext Only. IEEE Trans. Comput. 1985, C-34, 81–85. [Google Scholar] [CrossRef]
  7. Matsui, M. Linear Cryptanalysis Method for DES Cipher. In Proceedings of the Advances in Cryptology—EUROCRYPT ’93; Helleseth, T., Ed.; Springer: Berlin/Heidelberg, Germany, 1994; pp. 386–397. [Google Scholar]
  8. Sarkar, P.; Maitra, S. Nonlinearity Bounds and Constructions of Resilient Boolean Functions. In Proceedings of the Advances in Cryptology—CRYPTO 2000; Bellare, M., Ed.; Springer: Berlin/Heidelberg, Germany, 2000; pp. 515–532. [Google Scholar]
  9. Maitra, S.; Pasalic, E. Further constructions of resilient Boolean functions with very high nonlinearity. IEEE Trans. Inf. Theory 2002, 48, 1825–1834. [Google Scholar] [CrossRef]
  10. Zhang, W.; Xiao, G. Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables. IEEE Trans. Inf. Theory 2009, 55, 5822–5831. [Google Scholar] [CrossRef] [Green Version]
  11. Carlet, C.; Charpin, P. Cubic Boolean functions with highest resiliency. IEEE Trans. Inf. Theory 2005, 51, 562–571. [Google Scholar] [CrossRef]
  12. Maitra, S.; Sarkar, P. Highly Nonlinear Resilient Functions Optimizing Siegenthaler’s Inequality. In Proceedings of the Advances in Cryptology—CRYPTO ’99; Wiener, M., Ed.; Springer: Berlin/Heidelberg, Germany, 1999; pp. 198–215. [Google Scholar]
  13. Pasalic, E.; Johansson, T. Further Results on the Relation Between Nonlinearity and Resiliency for Boolean Functions. In Proceedings of the Cryptography and Coding; Walker, M., Ed.; Springer: Berlin/Heidelberg, Germany, 1999; pp. 35–44. [Google Scholar]
  14. Huang, J.; Huang, Q.; Susilo, W. Leakage-resilient group signature: Definitions and constructions. Inf. Sci. 2020, 509, 119–132. [Google Scholar] [CrossRef]
  15. Gao, S.; Ma, W.; Zhao, Y.; Zhuo, Z. Walsh Spectrum of Cryptographically Concatenating Functions and Its Applications in Constructing Resilient Boolean Functions. J. Comput. Inf. Syst. 2011, 7, 1074–1081. [Google Scholar]
  16. Singh, D. Construction of Highly Nonlinear Plateaued Resilient Functions with Disjoint Spectra. In Proceedings of the CCIS; Balasubramaniam, P., Uthayakumar, R., Eds.; Springer: Berlin/Heidelberg, Germany, 2012; pp. 522–529. [Google Scholar]
  17. Carlet, C. Recursive Lower Bounds on the Nonlinearity Profile of Boolean Functions and Their Applications. IEEE Trans. Inf. Theory 2008, 54, 1262–1272. [Google Scholar] [CrossRef]
  18. Biham, E.; Shamir, A. Differential cryptanalysis of DES-like cryptosystems. J. Cryptol. 1991, 4, 3–72. [Google Scholar] [CrossRef]
  19. Fourquet, R.; Tavernier, C. An improved list decoding algorithm for the second order Reed–Muller codes and its applications. Des. Codes Cryptogr. 2008, 49, 323–340. [Google Scholar] [CrossRef]
  20. Sun, G.; Wu, C. The lower bounds on the second order nonlinearity of three classes of Boolean functions with high nonlinearity. Inf. Sci. 2009, 179, 267–278. [Google Scholar] [CrossRef]
  21. Gode, R.; Gangopadhyay, S. Third-order nonlinearities of a subclass of Kasami functions. Cryptogr. Commun. 2010, 2, 69–83. [Google Scholar] [CrossRef]
  22. Singh, D.; Paul, A. On 4th-order nonlinearity of a Subclass of Kasami Functions. In Proceedings of the 2nd International Conference on Science, Technology and Management; University of Delhi: New Delhi, India, 2015; pp. 1262–1269. [Google Scholar]
  23. Maitra, S.; Sarkar, P. Modifications of Patterson-Wiedemann functions for cryptographic applications. IEEE Trans. Inf. Theory 2002, 48, 278–284. [Google Scholar] [CrossRef]
  24. Siegenthaler, T. Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.). IEEE Trans. Inf. Theory 1984, 30, 776–780. [Google Scholar] [CrossRef]
  25. Macwilliams, F.; Sloane, N. The Theory of Error Correcting Codes; North Holland Publishing: Amsterdam, The Netherlands, 2015; Volume 16. [Google Scholar]
  26. Bracken, C.; Byrne, E.; Markin, N.; McGuire, G. Determining the Nonlinearity of a New Family of APN Functions. In Proceedings of the Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; Boztaş, S., Lu, H.F.F., Eds.; Springer: Berlin/Heidelberg, Germany, 2007; pp. 72–79. [Google Scholar]
Figure 1. Nonlinearity of function Φ in Theorem 3, and F and G in [16].
Figure 1. Nonlinearity of function Φ in Theorem 3, and F and G in [16].
Mathematics 10 04473 g001
Figure 2. Bounds obtained in Theorem 4 for i = 4, i = 5, i = 6, and general bounds in [17].
Figure 2. Bounds obtained in Theorem 4 for i = 4, i = 5, i = 6, and general bounds in [17].
Mathematics 10 04473 g002
Figure 3. Bounds obtained in Theorem 5, [3,17].
Figure 3. Bounds obtained in Theorem 5, [3,17].
Mathematics 10 04473 g003
Table 1. Nonlinearity obtained in Theorems 2 and 3, and in [15,16] for n 7 .
Table 1. Nonlinearity obtained in Theorems 2 and 3, and in [15,16] for n 7 .
n711151923
F and G in [15]6415,872258,0484,161,53666,846,720
Functions in Theorem 3, [16]6415,872258,0484,161,53666,846,720
Φ in Theorem 39616,128260,0964,177,92066,977,792
Table 2. Bounds due to Theorem 4 and [17] for n 9 , and n 2 i with i an integer.
Table 2. Bounds due to Theorem 4 and [17] for n 9 , and n 2 i with i an integer.
n91011121314151617181920
Bounds of Theorem 4 i = 4 224316332693718744797959623,03846,079106,266212,538
i = 5 --8517065113033750749919,19338,38892,161184,326
i = 6 ----3406802606521315,00030,00176,778153,559
General bounds in [17]163264128256512102420484096819216,38432,768
Table 3. Comparison of bounds due to Theorem 5, [3,17] for n 9 .
Table 3. Comparison of bounds due to Theorem 5, [3,17] for n 9 .
n91011121314151617181920
Bounds of Theorem 5224316332693718744797959623,03846,079106,266212,538
Bounds for inverse function [17]--------274810,83831,89483,343
Carlet’s general bounds [17]163264128256512102420484096819216,38432,768
Iwata-Kurosawa’s bounds [3]3664144256576102423044096921616,38436,86465,536
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Singh, D.; Paul, A.; Kumar, N.; Stoffová, V.; Verma, C. Resiliency and Nonlinearity Profiles of Some Cryptographic Functions. Mathematics 2022, 10, 4473. https://doi.org/10.3390/math10234473

AMA Style

Singh D, Paul A, Kumar N, Stoffová V, Verma C. Resiliency and Nonlinearity Profiles of Some Cryptographic Functions. Mathematics. 2022; 10(23):4473. https://doi.org/10.3390/math10234473

Chicago/Turabian Style

Singh, Deep, Amit Paul, Neerendra Kumar, Veronika Stoffová, and Chaman Verma. 2022. "Resiliency and Nonlinearity Profiles of Some Cryptographic Functions" Mathematics 10, no. 23: 4473. https://doi.org/10.3390/math10234473

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop