%0 Journal Article
%T A Graph Theoretic Approach to Construct Desired Cryptographic Boolean Functions
%A Frank Emmert-Streib
%A Matthias Dehmer
%A Modjtaba Ghorbani
%A Vahid Taghvayi-Yazdelli
%J -
%D 2019
%R https://doi.org/10.3390/axioms8020040
%X Abstract In this paper, we present four product operations to construct cryptographic boolean functions from smaller ones with predictable Walsh spectrum. A lot of cryptographic properties of boolean functions can be presented by their Walsh spectrum. In our method, we use the product of Cayley graphs to present new boolean functions with desired Walsh spectrum and investigate their non-linearity, algebraic and correlation immunity. View Full-Tex
%K boolean functions
%K Walsh spectrum
%K Cayley graphs
%K algebraic immunity
%K non-linearity
%U https://www.mdpi.com/2075-1680/8/2/40