4255 search results - page 27 / 851 » On Learning Boolean Functions |
ICCAD
1996
IEEE
15 years 4 months ago
1996
IEEE
We presenta new representationfor Boolean functions called PartitionedROBDDs. In this representation we divide the Boolean space into `k' partitions and represent a function ...
TIT
2008
14 years 11 months ago
2008
The nonlinearity profile of a Boolean function (i.e. the sequence of its minimum Hamming distances nlr(f) to all functions of degrees at most r, for r 1) is a cryptographic crite...
DCC
2008
IEEE
15 years 11 months ago
2008
IEEE
A set of Boolean functions is called a bent set if the sum of any two distinct members is a bent function. We show that any bent set yields a homogeneous system of linked symmetric...
FSE
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we study the minimum distance between the set of bent functions and the set of 1-resilient Boolean functions and present a lower bound on that. The bound is proved to...
121
click to vote
TIT
2008
14 years 11 months ago
2008
Abstract. The recent algebraic attacks have received a lot of attention in cryptographic literature. The algebraic immunity of a Boolean function quantifies its resistance to the s...