published by Peter Schneider-Kamp
in 2015
in Informatics Engineering
and research's language is
English
Download
Abstract in English
We apply the pigeonhole principle to show that there must exist Boolean functions on 7 inputs with a multiplicative complexity of at least 7, i.e., that cannot be computed with only 6 multiplications in the Galois field with two elements.