Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

28

COCO
2005
Springer

favoriteEmaildiscussreport

112views Algorithms» more COCO 2005»

On Constructing Parallel Pseudorandom Generators from One-Way Functions

14 years 4 months ago

On Constructing Parallel Pseudorandom Generators from One-Way Functions

Download eprint.iacr.org

Emanuele Viola

Real-time Traffic

COCO 2005 |

claim paper

Related Content

» Efficiency Improvements in Constructing Pseudorandom Generators from OneWay Functions

» Universal OneWay Hash Functions via Inaccessible Entropy

» On the Construction of OneWay Functions from Average Case Hardness

» The complexity of constructing pseudorandom generators from hard functions

» Practical Construction and Analysis of PseudoRandomness Primitives

» Pseudorandomness from Braid Groups

» Towards a Theory of Extractable Functions

» Simple Extractors via Constructions of Cryptographic Pseudorandom Generators

» Algebraic pseudorandom functions with improved efficiency from the augmented cascade

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	COCO
Authors	Emanuele Viola

Comments (0)