Back to Results
First PageMeta Content
Pseudorandomness / Computational complexity theory / Randomness / Hashing / Pseudorandom generator theorem / Pseudorandom generator / One-way function / Hard-core predicate / Cryptographic hash function / Cryptography / Theoretical computer science / Applied mathematics


Saving Private Randomness in One-Way Functions and Pseudorandom Generators Nenad Dedi´c∗ ‡ § Danny Harnik† §
Add to Reading List

Document Date: 2007-12-10 11:39:44

Open Document

File Size: 306,51 KB

Share Result on Facebook

City

Boston / Haifa / New York / /

Company

Google Inc. / IBM / /

Country

Israel / /

Currency

pence / /

/

Facility

Boston University / /

IndustryTerm

hardware device / basic tool / /

Organization

UCLA / Boston University / Department of Computer Science / Institute for Pure and Applied Mathematics / Technion / /

Person

Danny Harnik / Leonid Reyzin / Yn / /

/

Position

advocate / strong extractor / /

ProvinceOrState

Ohio / Massachusetts / New York / /

Technology

block cipher / secret key / /

URL

http /

SocialTag