Sign Up to like & get
recommendations!
0
Published in 2018 at "Cryptography and Communications"
DOI: 10.1007/s12095-018-0297-2
Abstract: 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…
read more here.
Keywords:
functions multiplicative;
complexity;
boolean functions;
multiplicative complexity ... See more keywords