On the multiplicative complexity of Boolean functions and bitsliced higher-order masking (Q1695993)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the multiplicative complexity of Boolean functions and bitsliced higher-order masking |
scientific article; zbMATH DE number 6838315
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the multiplicative complexity of Boolean functions and bitsliced higher-order masking |
scientific article; zbMATH DE number 6838315 |
Statements
On the multiplicative complexity of Boolean functions and bitsliced higher-order masking (English)
0 references
14 February 2018
0 references
0.9349485
0 references
0.9293022
0 references
0.91259134
0 references
0.90579486
0 references
0.90004086
0 references
0.89851916
0 references
0.89359057
0 references
0.89359057
0 references
