Constructing Bent Functions for Cryptography with Binary Functions
Milos Radmanovic
Journal of Multimedia Processing and Technologies, Vol. 11, No. 3, 2020.
DOI: https://doi.org/10.6025/jmpt/2020/11/3/95-101
Link: http://www.dline.info/jmpt/fulltext/v11n3/jmptv11n3_3.pdf
Abstract:
We in this paper deal with Bent functions which are essential for cryptographic binary functions. These functions make very small subset of the total number of bent functions, especially for large number of variables. We do not find any formal method for construction of bent functions. Hence the methods for construction of bent functions are obtained by using the discovery of bent functions within a group of functions. For experimenting the bentness across a group of functions, even for small numbers of variables, requires a lot of processing time. We in this work introduced an efficient method for bentness testing of binary functions using statistical analysis of binary functions. The standard method for bentness testing is based on the usage of the fast Walsh transform calculations. This method uses conditional testing of the initial set of particular Walsh coefficients. In the current work, the selection of coefficients for conditional testing is determined using statistical analysis of binary functions.