A Graph Theoretic Approach to Construct Desired Cryptographic Boolean Functions
Department of Mathematics, Faculty of Science, Shahid Rajaee, Teacher Training University, Tehran 16785-136, Iran
Steyr School of Management, University of Applied Sciences Upper Austria, 4400 Steyr, Austria
Department of Biomedical Computer Science and Mechatronics, UMIT, 6060 Hall in Tyrol, Austria
College of Artificial Intelligence, Nankai University, Tianjin 300071, China
Predictive Medicine and Data Analytics Lab, Department of Signal Processing, Tampere University of Technology, 33100 Tampere, Finland
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.
Received: 7 January 2019 / Revised: 15 March 2019 / Accepted: 26 March 2019 / Published: 3 April 2019
PDF [253 KB, uploaded 9 April 2019]
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.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
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.
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.
Ghorbani, Modjtaba; Dehmer, Matthias; Taghvayi-Yazdelli, Vahid; Emmert-Streib, Frank. 2019. "A Graph Theoretic Approach to Construct Desired Cryptographic Boolean Functions." Axioms 8, no. 2: 40.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.