Paper 2018/002
The Multiplicative Complexity of 6-variable Boolean Functions
Cagdas Calik, Meltem Sonmez Turan, and Rene Peralta
Abstract
The multiplicative complexity of a Boolean function is the minimum number of AND gates that are necessary and sufficient to implement the function over the basis (AND, XOR, NOT). Finding the multiplicative complexity of a given function is computationally intractable, even for functions with small number of inputs. Turan et al. showed that
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Contact author(s)
- meltemsturan @ gmail com
- History
- 2018-01-02: received
- Short URL
- https://ia.cr/2018/002
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/002, author = {Cagdas Calik and Meltem Sonmez Turan and Rene Peralta}, title = {The Multiplicative Complexity of 6-variable Boolean Functions}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/002}, year = {2018}, url = {https://eprint.iacr.org/2018/002} }