Crosscorrelation Spectra of Dillon and Patterson-Wiedemann type Boolean Functions

In this paper we study the additive crosscorrelation spectra between two Boolean functions whose supports are union of certain cosets. These functions on even number of input variables have been introduced by Dillon and we refer to them as Dillon type functions. Our general result shows that the crosscorrelation spectra between any two Dillon type functions are at most 5-valued. As a consequence we find that the crosscorrelation spectra between two Dillon type bent functions on n-variables are at most 3-valued with maximum possible absolute value at the nonzero points being ≤ 2 n 2 . Moreover, in the same line, the autocorrelation spectra of Dillon type bent functions at different decimations is studied. Further we demonstrate that these results can be used to show the existence of a class of polynomials for which the absolute value of the Weil sum has a sharper upper bound than the Weil bound. Patterson and Wiedemann extended the idea of Dillon for functions on odd number of variables. We study the crosscorrelation spectra between two such functions and then use the results for calculating the autocorrelation spectra too.

[1]  Guang Gong,et al.  Transform domain analysis of DES , 1999, IEEE Trans. Inf. Theory.

[2]  Igor E. Shparlinski,et al.  Open problems and conjectures in finite fields , 1996 .

[3]  A. Canteaut,et al.  Decomposing bent functions , 2002, Proceedings IEEE International Symposium on Information Theory,.

[4]  Sugata Gangopadhyay,et al.  Patterson-Wiedemann Construction Revisited , 2003, Electron. Notes Discret. Math..

[5]  Guang Gong,et al.  Theory and applications of q-ary interleaved sequences , 1995, IEEE Trans. Inf. Theory.

[6]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: Preface , 1994 .

[7]  Nicholas J. Patterson,et al.  Correction to 'The covering radius of the (215, 16) Reed-Muller code is at least 16276' (May 83 354-356) , 1990, IEEE Trans. Inf. Theory.

[8]  O. S. Rothaus,et al.  On "Bent" Functions , 1976, J. Comb. Theory, Ser. A.

[9]  J. Dillon.  Elementary Hadamard Difference Sets , 1974 .

[10]  Nicholas J. Patterson,et al.  The covering radius of the (215, 16) Reed-Muller code is at least 16276 , 1983, IEEE Trans. Inf. Theory.

[11]  Palash Sarkar,et al.  Modifications of Patterson-Wiedemann functions for cryptographic applications , 2002, IEEE Trans. Inf. Theory.

[12]  S. D. Cohen.  COMPUTATIONAL AND ALGORITHMIC PROBLEMS IN FINITE FIELDS , 1994 .

[13]  Palash Sarkar,et al.  Cross-Correlation Analysis of Cryptographically Useful Boolean Functions and S-Boxes , 2001, Theory of Computing Systems.

[14]  Palash Sarkar,et al.  Construction of Nonlinear Boolean Functions with Important Cryptographic Properties , 2000, EUROCRYPT.

[15]  Amr M. Youssef,et al.  Hyper-bent Functions , 2001, EUROCRYPT.

[16]  A. Weil.  On Some Exponential Sums. , 1948, Proceedings of the National Academy of Sciences of the United States of America.

[17]  Cunsheng Ding,et al.  The Stability Theory of Stream Ciphers , 1991, Lecture Notes in Computer Science.

[18]  Serguei A. Stepanov.  Character sums and coding theory , 1996 .

[19]  G. Lachaud,et al.  The weights of the orthogonals of the extended quadratic binary Goppa codes , 1990, IEEE Trans. Inf. Theory.

[20]  S. Stepanov.  Arithmetic of algebraic curves , 1994 .