The number of Boolean functions with multiplicative complexity 2

DOI10.1504/IJICOT.2017.10005826zbMATH Open1407.94195MaRDI QIDQ725955FDOQ725955

Authors: Magnus Find, Daniel Smith-Tone, Meltem Sönmez Turan 

Publication date: 2 August 2018

Published in: International Journal of Information and Coding Theory (Search for Journal in Brave)

Recommendations

• Multiplicative complexity of some Boolean functions
• Boolean functions with multiplicative complexity 3 and 4
• On the multiplicative complexity of some Boolean functions
• On the multiplicative complexity of Boolean functions
• On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).

zbMATH Keywords

affine transformationsBoolean circuitscryptographycircuit complexity

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (10)

• Upper bounds on the multiplicative complexity of symmetric Boolean functions
• The multiplicative complexity of 6-variable Boolean functions
• A multi-start heuristic for multiplicative depth minimization of Boolean circuits
• Title not available (Why is that?)
• Multiplicative complexity of some Boolean functions
• The multiplicative complexity of Boolean functions on four and five variables
• Title not available (Why is that?)
• On the multiplicative complexity of Boolean functions
• Boolean functions with multiplicative complexity 3 and 4
• Exact 2-divisibility of exponential sums associated to Boolean functions

This page was built for publication: The number of Boolean functions with multiplicative complexity 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q725955)