Tampere University of Technology

TUTCRIS Research Portal

A graph theoretic approach to construct desired cryptographic boolean functions

Research output: Contribution to journalArticleScientificpeer-review

Standard

A graph theoretic approach to construct desired cryptographic boolean functions. / Ghorbani, Modjtaba; Dehmer, Matthias; Taghvayi-Yazdelli, Vahid; Emmert-Streib, Frank.

In: Axioms, Vol. 8, No. 2, 40, 01.06.2019.

Research output: Contribution to journalArticleScientificpeer-review

Harvard

APA

Vancouver

Author

Ghorbani, Modjtaba ; Dehmer, Matthias ; Taghvayi-Yazdelli, Vahid ; Emmert-Streib, Frank. / A graph theoretic approach to construct desired cryptographic boolean functions. In: Axioms. 2019 ; Vol. 8, No. 2.

Bibtex - Download

@article{9815821bfb1e40b6aea51a94ede090f7,
title = "A graph theoretic approach to construct desired cryptographic boolean functions",
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.",
keywords = "Algebraic immunity, Boolean functions, Cayley graphs, Non-linearity, Walsh spectrum",
author = "Modjtaba Ghorbani and Matthias Dehmer and Vahid Taghvayi-Yazdelli and Frank Emmert-Streib",
year = "2019",
month = "6",
day = "1",
doi = "10.3390/axioms8020040",
language = "English",
volume = "8",
journal = "Axioms",
issn = "2075-1680",
publisher = "MDPI",
number = "2",

}

RIS (suitable for import to EndNote) - Download

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 -