A graph theoretic approach to construct desired cryptographic boolean functions

Modjtaba Ghorbani, Matthias Dehmer, Vahid Taghvayi-Yazdelli, Frank Emmert-Streib

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Article number40
JournalAxioms
Volume8
Issue number2
DOIs
Publication statusPublished - 1 Jun 2019

Keywords

  • Algebraic immunity
  • Boolean functions
  • Cayley graphs
  • Non-linearity
  • Walsh spectrum

Fingerprint Dive into the research topics of 'A graph theoretic approach to construct desired cryptographic boolean functions'. Together they form a unique fingerprint.

Cite this