290 search results - page 1 / 58 » Pseudorandom Bits for Polynomials |
FOCS
2007
IEEE
14 years 5 months ago
2007
IEEE
We present a new approach to constructing pseudorandom generators that fool lowdegree polynomials over finite fields, based on the Gowers norm. Using this approach, we obtain th...
STOC
2005
ACM
14 years 11 months ago
2005
ACM
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
IMA
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and Vazirani, who proved independently that O(log...
EUROCRYPT
2009
Springer
14 years 11 months ago
2009
Springer
We propose a methodology to construct verifiable random functions from a class of identity based key encapsulation mechanisms (IB-KEM) that we call VRF suitable. Informally, an IB-...
CRYPTO
2000
Springer
14 years 3 months ago
2000
Springer
Under the assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number, we construct a new and improved pse...