A graph theoretic approach to construct desired cryptographic boolean functions

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

doi:10.3390/axioms8020040

A graph theoretic approach to construct desired cryptographic boolean functions

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

^*Korrespondierende/r Autor/-in für diese Arbeit

Research Center Steyr

Publikation: Beitrag in Fachzeitschrift › Artikel › Begutachtung

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.

Originalsprache	Englisch
Aufsatznummer	40
Fachzeitschrift	Axioms
Jahrgang	8
Ausgabenummer	2
DOIs	https://doi.org/10.3390/axioms8020040
Publikationsstatus	Veröffentlicht - 1 Juni 2019

Zugriff auf Dokument

10.3390/axioms8020040

Andere Dateien und Links

Link to publication in Scopus

Zitieren

@article{dbe16a66f98347049f322b67b23ec805,

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 = jun,

day = "1",

doi = "10.3390/axioms8020040",

language = "English",

volume = "8",

journal = "Axioms",

issn = "2075-1680",

publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",

number = "2",

}

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

UR - https://www.scopus.com/pages/publications/85066846087

U2 - 10.3390/axioms8020040

DO - 10.3390/axioms8020040

M3 - Article

AN - SCOPUS:85066846087

SN - 2075-1680

VL - 8

JO - Axioms

JF - Axioms

IS - 2

M1 - 40

ER -

A graph theoretic approach to construct desired cryptographic boolean functions

Abstract

Zugriff auf Dokument

Andere Dateien und Links

Fingerprint

Zitieren