Constructions of bent functions and difference sets

From MaRDI portal





[For the entire collection see Zbl 0755.00009.] Based on the work of \textit{O. S. Rothaus} [J. Comb. Theory, Ser. A 20, 300-305 (1976; Zbl 0336.12012)], \textit{J. D. Olsen}, \textit{R. A. Scholtz} and \textit{L. R. Welch} suggested the bent functions to be used as feed- forward functions to generate binary sequences which posess high linear complexity and very nearly optimum cross-correlation properties [IEEE Trans. Inf. Theory IT-28, 858-864 (1982; Zbl 0492.94019)]. In [Advances in cryptology, EUROCRYPT '89, Proc. Workshop, Houthalen/Belg. 1989, Lect. Notes Comput. Sci. 434, 549-562 (1990; Zbl 0724.94009)] \textit{W. Meier} and \textit{O. Staffelbach} discovered, that binary bent functions give a solution to the correlation problem when used as combining functions of several binary linear shiftregister sequences. One of their results is that bent functions are at maximum distance to the set of affine functions. We refer to [loc. cit.] for the cryptographic background and motivation. The general theory of the bent functions from \(\mathbb{Z}^ n_ q\) to \(\mathbb{Z}_ q\) was developed by \textit{P. V. Kumar}, \textit{R. A. Scholtz} and \textit{L. R. Welch} [J. Comb. Theory, Ser. A 40, 90-107 (1985; Zbl 0585.94016)]. The main purpose of this paper is to consider the cryptographic properties of generalized bent functions. In \(\S2\) we give the basic definitions and properties of bent functions. Our main results are concerned with the value distributions of \(p\)-ary bent functions, \(p\) prime, and their distances to the set of affine functions, and are given in \(\S3\). In \(\S4\) a method is given to produce all binary bent functions. We also consider the relation between difference sets and bent functions and review the previous construction methods and their properties.




Cited in
(48)








This page was built for publication: Constructions of bent functions and difference sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036866)