On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
type: Item
instance of: scholarly article
title: On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
zbMATH Open document ID: 1411.94063
DOI: 10.1007/978-3-662-53140-2_22
author: Dahmun Goudarzi
author: Matthieu Rivain
publication date: 2018-02-14T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6838315
describes a project that uses: PRESENT
describes a project that uses: Serpent
describes a project that uses: SC2000
describes a project that uses: CLEFIA
MaRDI profile type: Publication
full work available at URL: 978-3-662-53140-2 22
OpenAlex ID: W2497251496
Recommended article: On the Multiplicative Complexity of Boolean Functions
Recommended article: On the multiplicative complexity of some Boolean functions
Recommended article: Q3832047
Recommended article: Multiplicative complexity of some Boolean functions
Recommended article: On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
Recommended article: Upper bounds on the multiplicative complexity of symmetric Boolean functions
Recommended article: Circuit Complexity and Multiplicative Complexity of Boolean Functions
Recommended article: On the modulo degree complexity of Boolean functions
Recommended article: The complexity of the representation of multiple-output Boolean functions
description: scientific article; zbMATH DE number 6838315