4255 search results - page 23 / 851 » On Learning Boolean Functions |
IPL
2010
13 years 6 months ago
2010
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In this paper we characterize (octal) bent generalized Boolean functions defined on Zn 2 with values in Z8. Moreover, we propose several constructions of such generalized bent fun...
ISLPED
1996
ACM
13 years 12 months ago
1996
ACM
Estimation of the area complexity of a Boolean function from its functional description is an important step towards a power estimation capability at the register transfer level (...
EUROCRYPT
1990
Springer
13 years 11 months ago
1990
Springer
The relation between the Walsh-Hadamard transform and the autocorrelation function of Boolean functions is used to study propagation characteristics of these functions. The Strict...
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This paper addresses the problem of obtaining new construction methods for cryptographically significant Boolean functions. We show that for each positive integer m, ther...