Upper bounds on the multiplicative complexity of symmetric Boolean functions

DOI10.1007/s12095-019-00377-3zbMath1446.94215OpenAlexW2968960252WikidataQ89966425 ScholiaQ89966425MaRDI QIDQ2179499

Çağdaş Çalık, Meltem Sönmez Turan, Luís T. A. N. Brandão, René Peralta

Publication date: 12 May 2020

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc7047778

zbMATH Keywords

upper boundssymmetric Boolean functionsmultiplicative complexitylogic minimization

Mathematics Subject Classification ID

Boolean functions (06E30) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Related Items

Boolean functions with multiplicative complexity 3 and 4

Uses Software

• GitHub
• Circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of Boolean functions with multiplicative complexity 2
• Tight bounds for the multiplicative complexity of symmetric functions
• Short non-interactive cryptographic proofs
• The multiplicative complexity of 6-variable Boolean functions
• On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
• (Leveled) fully homomorphic encryption without bootstrapping
• The Multiplicative Complexity of Boolean Functions on Four and Five Variables
• Optimal 4-bit Reversible Mixed-Polarity Toffoli Circuits
• Improved Garbled Circuit: Free XOR Gates and Applications
• Symmetric Boolean Functions
• Bounds to Complexities of Networks for Sorting and for Switching
• Higher-Order Masking Schemes for S-Boxes
• On the Complexity of Computing Two Nonlinearity Measures