The multiplicative complexity of 6-variable Boolean functions

The multiplicative complexity of a Boolean function is the minimum number of two-input 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 wi...

Full description

Saved in:

Bibliographic Details
Published in:	Cryptography and communications Vol. 11; no. 1; pp. 93 - 107
Main Authors:	Çalık, Çağdaş, Sönmez Turan, Meltem, Peralta, René
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.01.2019 Springer Nature B.V
Subjects:	Affine transformations Boolean algebra Boolean functions Boolean Functions and their Applications II Circuits Codes Coding and Information Theory Communications Engineering Complexity Computer Science Data Structures and Information Theory Equivalence Gates Information and Communication Mathematical analysis Mathematics of Computing Networks 06E30 Boolean functions Multiplicative complexity 94A60 Affine equivalence Cryptography Circuit complexity
ISSN:	1936-2447, 1936-2455
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!