406 search results - page 10 / 82 » Pseudorandomness and Combinatorial Constructions |
96
Voted
CCS
2005
ACM
15 years 4 months ago
2005
ACM
We present a formal model and a simple architecture for robust pseudorandom generation that ensures resilience in the face of an observer with partial knowledge/control of the gen...
DCC
2005
IEEE
15 years 10 months ago
2005
IEEE
We give a combinatorial construction of a one-parameter and a two-parameter family of complete caps in finite projective spaces over GF(2). As an application of our construction w...
TCC
2010
Springer
15 years 3 months ago
2010
Springer
Related-key attacks are attacks against constructions which use a secret key (such as a blockcipher) in which an attacker attempts to exploit known or chosen relationships among ke...
ECCC
2010
14 years 11 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...
83
Voted
CCS
2010
ACM
14 years 11 months ago
2010
ACM
We construct an algebraic pseudorandom function (PRF) that is more efficient than the classic NaorReingold algebraic PRF. Our PRF is the result of adapting the cascade constructio...