Back to Results
First PageMeta Content
Randomness / Pseudorandomness / Information theory / Computational complexity theory / Pseudorandom number generators / Pseudorandom generator / Leftover hash lemma / Entropy / Fortuna / Theoretical computer science / Applied mathematics / Cryptography


Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions∗ Iftach Haitner† and Omer Reingold‡ and Salil Vadhan§ May 24, 2012 Abstract
Add to Reading List

Document Date: 2013-11-27 11:40:21

Open Document

File Size: 277,71 KB

Share Result on Facebook

Company

Functions / Pseudorandom Generators We / Microsoft / /

Country

United States / /

/

Facility

Tel Aviv University / Silicon Valley Campus / Weizmann Institute of Science / New England Campus / Harvard University / /

IndustryTerm

probabilistic algorithm / /

NaturalFeature

Shannon / /

Organization

School of Computer Science / Tel Aviv University / School of Engineering and Applied Sciences / Center for Research / Harvard University / National Science Foundation / Weizmann Institute of Science / /

Person

Omer Reingold / /

Technology

cryptography / probabilistic algorithm / /

SocialTag