16 search results - page 3 / 4 » On the degree of symmetric functions on the Boolean cube |
EUROCRYPT
2006
Springer
13 years 9 months ago
2006
Springer
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSRbased s...
ECCC
2010
13 years 5 months ago
2010
![Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/pseudorandom_generators_for_cc0_p_and_the_fourier_spectrum_of_low_degree_polynomials_over_finite_fields_ECCC_2010.jpg "Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields")
In this paper we give the first construction of a pseudorandom generator, with seed length O(log n), for CC0[p], the class of constant-depth circuits with unbounded fan-in MODp ga...
CRYPTO
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. One of the most basic requirements concerning Boolean functions used in cryptosystems is that they must have high algebraic degrees. This simple criterion is not always w...
ECCC
2007
13 years 5 months ago
2007
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
FOCS
1989
IEEE
13 years 9 months ago
1989
IEEE
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...