scientific article; zbMATH DE number 1071791

From MaRDI portal
Publication:4359107





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.











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)