The multiplicative complexity of 6-variable Boolean functions
type: Item
instance of: scholarly article
title: The multiplicative complexity of 6-variable Boolean functions
zbMATH Open document ID: 1420.94044
author: Çağdaş Çalık
author: Meltem Sönmez Turan
author: René Peralta
published in: Cryptography and Communications
publication date: 2019-01-08T00:00:00Z
full work available at URL: PMC7802510
Mathematics Subject Classification ID: 94D10
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 06E30
zbMATH DE Number: 6998172
zbMATH Keywords: affine equivalence
zbMATH Keywords: Boolean functions
zbMATH Keywords: circuit complexity
zbMATH Keywords: cryptography
zbMATH Keywords: multiplicative complexity
MaRDI profile type: Publication
OpenAlex ID: W2796205655
cites work: The Multiplicative Complexity of Boolean Functions on Four and Five Variables
cites work: Improved Garbled Circuit: Free XOR Gates and Applications
cites work: (Leveled) fully homomorphic encryption without bootstrapping
cites work: Short non-interactive cryptographic proofs
cites work: Higher-Order Masking Schemes for S-Boxes
cites work: On the Complexity of Computing Two Nonlinearity Measures
cites work: Tight bounds for the multiplicative complexity of symmetric functions
cites work: On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
cites work: Weight distributions of the cosets of the (32,6) Reed-Muller code
cites work: A Classification of the Cosets of the Reed-Muller Code R (1, 6)
cites work: Automata, Languages and Programming
cites work: \(AGL(m,2)\) acting on \(R(r,m)/R(s,m)\)
cites work: Q3081625
cites work: Subspaces, subsets, and partitions
cites work: On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
Wikidata QID: Q130035932
DOI: 10.1007/S12095-018-0297-2
describes a project that uses: GitHub
description: scientific article; zbMATH DE number 6998172