Sciweavers

707 search results - page 45 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
TIT
2008
78views more  TIT 2008»
13 years 7 months ago
Recursive Lower Bounds on the Nonlinearity Profile of Boolean Functions and Their Applications
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...
Claude Carlet
TIT
2008
130views more  TIT 2008»
13 years 7 months ago
Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity
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...
Sihem Mesnager
ICCD
1996
IEEE
170views Hardware» more  ICCD 1996»
14 years 2 days ago
Boolean Function Representation Based on Disjoint-Support Decompositions
The Multi-Level Decomposition Diagrams (MLDDs) of this paper are a canonical representation of Boolean functions expliciting disjoint-support decompositions. MLDDs allow the reduc...
Valeria Bertacco, Maurizio Damiani
COLT
2008
Springer
13 years 9 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
CORR
2008
Springer
156views Education» more  CORR 2008»
13 years 8 months ago
Pairing Functions, Boolean Evaluation and Binary Decision Diagrams
A "pairing function" J associates a unique natural number z to any two natural numbers x,y such that for two "unpairing functions" K and L, the equalities K(J(x...
Paul Tarau