Sciweavers

3007 search results - page 78 / 602
» Linear Functional Fixed-points
Sort
View
ACISP
2003
Springer
15 years 5 months ago
New Constructions for Resilient and Highly Nonlinear Boolean Functions
Abstract. We explore three applications of geometric sequences in constructing cryptographic Boolean functions. First, we construct 1-resilient functions of n Boolean variables wit...
Khoongming Khoo, Guang Gong
DCC
2006
IEEE
15 years 11 months ago
A New Characterization of Semi-bent and Bent Functions on Finite Fields*
We present a new characterization of semi-bent and bent quadratic functions on finite fields. First, we determine when a GF(2)-linear combination of Gold functions Tr(x2i +1 ) is ...
Khoongming Khoo, Guang Gong, Douglas R. Stinson
PKC
2010
Springer
177views Cryptology» more  PKC 2010»
15 years 3 months ago
More Constructions of Lossy and Correlation-Secure Trapdoor Functions
We propose new and improved instantiations of lossy trapdoor functions (Peikert and Waters, STOC ’08), and correlation-secure trapdoor functions (Rosen and Segev, TCC ’09). Ou...
David Mandell Freeman, Oded Goldreich, Eike Kiltz,...
NIPS
2007
15 years 1 months ago
DIFFRAC: a discriminative and flexible framework for clustering
We present a novel linear clustering framework (DIFFRAC) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The...
Francis Bach, Zaïd Harchaoui
ALT
2001
Springer
15 years 8 months ago
Learning of Boolean Functions Using Support Vector Machines
This paper concerns the design of a Support Vector Machine (SVM) appropriate for the learning of Boolean functions. This is motivated by the need of a more sophisticated algorithm ...
Ken Sadohara