Sciweavers

112 search results - page 18 / 23
» On the nonlinearity of monotone Boolean functions
Sort
View
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
14 years 9 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
88
Voted
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 3 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
EUROCRYPT
2003
Springer
15 years 2 months ago
Algebraic Attacks on Stream Ciphers with Linear Feedback
A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f. Their security is usually analysed in terms of correlation attack...
Nicolas Courtois, Willi Meier
IACR
2011
91views more  IACR 2011»
13 years 9 months ago
A Scalable Method for Constructing Galois NLFSRs with Period $2^n-1$ using Cross-Join Pairs
This paper presents a method for constructing n-stage Galois NLFSRs with period 2n − 1 from n-stage maximum length LFSRs. We introduce nonlinearity into state cycles by adding a ...
Elena Dubrova
FSE
2003
Springer
125views Cryptology» more  FSE 2003»
15 years 2 months ago
On Plateaued Functions and Their Constructions
We use the notion of covering sequence, introduced by C. Carlet and Y. Tarannikov, to give a simple characterization of bent functions. We extend it into a characterization of plat...
Claude Carlet, Emmanuel Prouff