Boolean functions with multiplicative complexity 3 and 4

Multiplicative complexity (MC) is defined as the minimum number of AND gates required to implement a function with a circuit over the basis (AND, XOR, NOT). Boolean functions with MC 1 and 2 have been characterized in Fisher and Peralta ( 2002 ), and Find et al. (IJICoT 4 (4), 222–236, 2017 ), respe...

Full description

Saved in:

Bibliographic Details
Published in:	Cryptography and communications Vol. 12; no. 5; pp. 935 - 946
Main Authors:	Çalık, Çağdaş, Turan, Meltem Sönmez, Peralta, René
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.09.2020 Springer Nature B.V
Subjects:	Affine transformations Boolean Boolean algebra Boolean functions Circuits Codes Coding and Information Theory Communications Engineering Complexity Computer Science Data Structures and Information Theory Equivalence Gates (circuits) Information and Communication Linearity Lower bounds Mathematics of Computing Networks 06E30 Boolean functions 94A60 Affine equivalence Multiplicative 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!