A graph theoretic approach to construct desired cryptographic Boolean functions (Q2306306)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A graph theoretic approach to construct desired cryptographic Boolean functions |
scientific article |
Statements
A graph theoretic approach to construct desired cryptographic Boolean functions (English)
0 references
23 March 2020
0 references
Summary: 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.
0 references
Boolean functions
0 references
Walsh spectrum
0 references
Cayley graphs
0 references
algebraic immunity
0 references
non-linearity
0 references
0 references
