Next Article in Journal
The 3D Navier–Stokes Equations: Invariants, Local and Global Solutions
Previous Article in Journal
Pricing Compound and Extendible Options under Mixed Fractional Brownian Motion with Jumps
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
Axioms
Volume 8
Issue 2
10.3390/axioms8020040
axioms-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Graph Theoretic Approach to Construct Desired Cryptographic Boolean Functions

by
Modjtaba Ghorbani
1,*,
Matthias Dehmer
2,3,4,
Vahid Taghvayi-Yazdelli
1 and
Frank Emmert-Streib
5,6
1
Department of Mathematics, Faculty of Science, Shahid Rajaee, Teacher Training University, Tehran 16785-136, Iran
2
Steyr School of Management, University of Applied Sciences Upper Austria, 4400 Steyr, Austria
3
Department of Biomedical Computer Science and Mechatronics, UMIT, 6060 Hall in Tyrol, Austria
4
College of Artificial Intelligence, Nankai University, Tianjin 300071, China
5
Predictive Medicine and Data Analytics Lab, Department of Signal Processing, Tampere University of Technology, 33100 Tampere, Finland
6
Predictive Society and Data Analytics Lab, Faculty of Information Technology and Communication Sciences, Tampere University, 33720 Tampere, Finland
*
Author to whom correspondence should be addressed.
Axioms 2019, 8(2), 40; https://doi.org/10.3390/axioms8020040
Submission received: 7 January 2019 / Revised: 15 March 2019 / Accepted: 26 March 2019 / Published: 3 April 2019
Review Reports Versions Notes

Abstract

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.
Keywords: boolean functions; Walsh spectrum; Cayley graphs; algebraic immunity; non-linearity boolean functions; Walsh spectrum; Cayley graphs; algebraic immunity; non-linearity

Share and Cite

MDPI and ACS Style

Ghorbani, M.; Dehmer, M.; Taghvayi-Yazdelli, V.; Emmert-Streib, F. A Graph Theoretic Approach to Construct Desired Cryptographic Boolean Functions. Axioms 2019, 8, 40. https://doi.org/10.3390/axioms8020040

AMA Style

Ghorbani M, Dehmer M, Taghvayi-Yazdelli V, Emmert-Streib F. A Graph Theoretic Approach to Construct Desired Cryptographic Boolean Functions. Axioms. 2019; 8(2):40. https://doi.org/10.3390/axioms8020040

Chicago/Turabian Style

Ghorbani, Modjtaba, Matthias Dehmer, Vahid Taghvayi-Yazdelli, and Frank Emmert-Streib. 2019. "A Graph Theoretic Approach to Construct Desired Cryptographic Boolean Functions" Axioms 8, no. 2: 40. https://doi.org/10.3390/axioms8020040

APA Style

Ghorbani, M., Dehmer, M., Taghvayi-Yazdelli, V., & Emmert-Streib, F. (2019). A Graph Theoretic Approach to Construct Desired Cryptographic Boolean Functions. Axioms, 8(2), 40. https://doi.org/10.3390/axioms8020040

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop