scientific article; zbMATH DE number 1071791
Bent Boolean functions are functions interesting for cryptography because of their perfect nonlinearity. The drawback of them is that they are neither balanced nor have the first other correlation-immunity. Moreover, very few of them are known. \textit{C. Carlet} [Des. Codes Cryptography 3, 135-145 (1993; Zbl 0772.94005)] introduced so called partially-bent functions. Many of them have the desired property of correlation -- immunity and balance. These functions are bent if they are limited in a subspace. In this way Carlet [loc. cit.] provides a method of finding good Boolean functions for cryptography. In this paper the author introduces the notion ``linear kernel of a Boolean function. Using this notion the author develops a technique enabling to analyse the suitability of partially-bent-functions for cryptographical purposes.
- scientific article; zbMATH DE number 1076147
- On a property of linear Boolean functions
- On linear decomposition of Boolean functions
- The generalized complexity of linear Boolean functions
- Boolean functions on \(S_n\) which are nearly linear
- scientific article; zbMATH DE number 5504481
- On minimal realizations of linear Boolean functions
- On Boolean bent functions
- scientific article; zbMATH DE number 4049559
- Bent functions linear on elements of some classical spreads and presemifields spreads
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359107)