Sciweavers

247 search results - page 5 / 50
» On Pseudorandom Generators in NC
Sort
View
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 5 months ago
Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions
We give a new construction of pseudorandom generators from any one-way function. The construction achieves better parameters and is simpler than that given in the seminal work of ...
Iftach Haitner, Omer Reingold and Salil Vadhan
DAGSTUHL
2006
15 years 3 months ago
Fault Jumping Attacks against Shrinking Generator
In this paper we outline two cryptoanalytic attacks against hardware implementation of the shrinking generator by Coppersmith et al., a classic design in low-cost, simple-design p...
Marcin Gomulkiewicz, Miroslaw Kutylowski, Pawel Wl...
ECCC
2010
77views more  ECCC 2010»
15 years 1 months ago
In a World of P=BPP
We show that proving results such as BPP = P essentially necessitate the construction of suitable pseudorandom generators (i.e., generators that suffice for such derandomization r...
Oded Goldreich
ECCC
2007
100views more  ECCC 2007»
15 years 1 months ago
Unconditional pseudorandom generators for low degree polynomials
Abstract: We give an explicit construction of a pseudorandom generator against lowdegree polynomials over finite fields. Pseudorandom generators against linear polynomials, known...
Shachar Lovett
ASIACRYPT
2006
Springer
15 years 5 months ago
On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the a...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang