{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:36:39Z","timestamp":1760240199481,"version":"build-2065373602"},"reference-count":17,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T00:00:00Z","timestamp":1554249600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/axioms8020040","type":"journal-article","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T03:13:42Z","timestamp":1554347622000},"page":"40","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Graph Theoretic Approach to Construct Desired Cryptographic Boolean Functions"],"prefix":"10.3390","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5623-9932","authenticated-orcid":false,"given":"Modjtaba","family":"Ghorbani","sequence":"first","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Shahid Rajaee, Teacher Training University, Tehran 16785-136, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Dehmer","sequence":"additional","affiliation":[{"name":"Steyr School of Management, University of Applied Sciences Upper Austria, 4400 Steyr, Austria"},{"name":"Department of Biomedical Computer Science and Mechatronics, UMIT, 6060 Hall in Tyrol, Austria"},{"name":"College of Artificial Intelligence, Nankai University, Tianjin 300071, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahid","family":"Taghvayi-Yazdelli","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Shahid Rajaee, Teacher Training University, Tehran 16785-136, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Emmert-Streib","sequence":"additional","affiliation":[{"name":"Predictive Medicine and Data Analytics Lab, Department of Signal Processing, Tampere University of Technology, 33100 Tampere, Finland"},{"name":"Predictive Society and Data Analytics Lab, Faculty of Information Technology and Communication Sciences, Tampere University, 33720 Tampere, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,4,3]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1109\/TIT.1984.1056949","article-title":"Correlation-immunity of nonlinear combining functions for cryptographic applications","volume":"30","author":"Siegenthaler","year":"1984","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Courtois, N., and Meier, W. (2003). Algebraic attacks on stream ciphers with linear feedback. Advances in Cryptology, Proceedings of the Eurocrypt\u201903. LNCS 2656, Springer.","DOI":"10.1007\/3-540-39200-9_21"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Courtois, N., and Pieprzyk, J. (2002). Cryptanalysis of block ciphers with overdefined systems of equations. Advances in Cryptology, Proceedings of the Asiacrypt 2002. LNCS 2501, Springer.","DOI":"10.1007\/3-540-36178-2_17"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1109\/12.755000","article-title":"Spectral analysis of Boolean functions as a graph eigenvalue problem","volume":"48","author":"Bernasconi","year":"1999","journal-title":"IEEE Trans. Comput."},{"key":"ref_5","unstructured":"Stanica, P. Graph eigenvalues and Walsh spectrum of Boolean functions. Combinatorial Number Theory, de Gruyter, Proceedings of the \u2018Integers Conference 2005\u2019 in Celebration of the 70th Birthday of Ron Graham, Carrollton, GA, USA, 27\u201330 October 2005."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Cusic, T.W., and Stanica, P. (2009). Cryptographic Boolean Functions and Applications, Elseveir Inc.","DOI":"10.1016\/B978-0-12-374890-4.00009-4"},{"key":"ref_7","unstructured":"Crama, Y., and Hammer, P.L. (2010). Boolean Functions for Cryptography and Error Correcting Codes. Chapter of the Monograph Boolean Models and Methods in Mathematics, Computer Science and Engineering, Cambridge University Press."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Wu, C., and Feng, D. (2016). Boolean Functions and Their Applications in Cryptography, Springer.","DOI":"10.1007\/978-3-662-48865-2"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Meier, W., and Staffelbach, O. (1990). Nonlinearity criteria for cryptographic functions. Advances in Cryptology, Proceedings of the Eurocrypt\u201989. LNCS 434, Springer.","DOI":"10.1007\/3-540-46885-4_53"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O., Hastad, J., Friedman, J., Rudich, S., and Smolensky, R. (1985, January 21\u201323). The bit extraction problem or t-resilient functions. Proceedings of the 26th Annual Symposium on Foundations of Computer Science, Portland, OR, USA.","DOI":"10.1109\/SFCS.1985.55"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0020-0190(93)90237-4","article-title":"A note on a conjecture concerning symmetric resilient functions","volume":"47","author":"Gopalakrishnan","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0020-0190(99)00091-5","article-title":"Hamming weights of correlation immune Boolean functions","volume":"71","author":"Maitra","year":"1999","journal-title":"Inform. Process Lett."},{"key":"ref_13","first-page":"51","article-title":"On the annihilators of cryptographic Boolean functions","volume":"34","author":"Wu","year":"2006","journal-title":"Acta Electron. Sin."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Biggs, N. (1974). Algebraic Graph Theory, Cambridge University Press.","DOI":"10.1017\/CBO9780511608704"},{"key":"ref_15","unstructured":"Imrich, W., and Klavzar, S. (2000). Product Graphs: Structure and Recognition, Wiley."},{"key":"ref_16","unstructured":"Abdollahi, A.R., and Loghman, A. Cayley graphs isomorphisms of the product of two Cayley graphs. Ars Combin., to appear."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"3235","DOI":"10.1016\/j.disc.2016.07.017","article-title":"Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs","volume":"340","author":"Abreu","year":"2017","journal-title":"Discret. Math."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/8\/2\/40\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:42:48Z","timestamp":1760186568000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/8\/2\/40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,3]]},"references-count":17,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2019,6]]}},"alternative-id":["axioms8020040"],"URL":"https:\/\/doi.org\/10.3390\/axioms8020040","relation":{},"ISSN":["2075-1680"],"issn-type":[{"type":"electronic","value":"2075-1680"}],"subject":[],"published":{"date-parts":[[2019,4,3]]}}}