A graph theoretic approach to construct desired cryptographic boolean functions
Tutkimustuotos › › vertaisarvioitu
Standard
A graph theoretic approach to construct desired cryptographic boolean functions. / Ghorbani, Modjtaba; Dehmer, Matthias; Taghvayi-Yazdelli, Vahid; Emmert-Streib, Frank.
julkaisussa: Axioms, Vuosikerta 8, Nro 2, 40, 01.06.2019.Tutkimustuotos › › vertaisarvioitu
Harvard
APA
Vancouver
Author
Bibtex - Lataa
}
RIS (suitable for import to EndNote) - Lataa
TY - JOUR
T1 - A graph theoretic approach to construct desired cryptographic boolean functions
AU - Ghorbani, Modjtaba
AU - Dehmer, Matthias
AU - Taghvayi-Yazdelli, Vahid
AU - Emmert-Streib, Frank
PY - 2019/6/1
Y1 - 2019/6/1
N2 - In this paper, we present four product operations to construct cryptographic boolean functions from smaller ones with predictableWalsh spectrum. A lot of cryptographic properties of boolean functions can be presented by theirWalsh spectrum. In our method, we use the product of Cayley graphs to present new boolean functions with desiredWalsh spectrum and investigate their non-linearity, algebraic and correlation immunity.
AB - In this paper, we present four product operations to construct cryptographic boolean functions from smaller ones with predictableWalsh spectrum. A lot of cryptographic properties of boolean functions can be presented by theirWalsh spectrum. In our method, we use the product of Cayley graphs to present new boolean functions with desiredWalsh spectrum and investigate their non-linearity, algebraic and correlation immunity.
KW - Algebraic immunity
KW - Boolean functions
KW - Cayley graphs
KW - Non-linearity
KW - Walsh spectrum
U2 - 10.3390/axioms8020040
DO - 10.3390/axioms8020040
M3 - Article
VL - 8
JO - Axioms
JF - Axioms
SN - 2075-1680
IS - 2
M1 - 40
ER -