Back to Results
First PageMeta Content
Pseudorandomness / Pseudorandom number generators / Computational complexity theory / Algorithmic information theory / Pseudorandom generator / Hard-core predicate / XTR / One-way function / Naor-Reingold Pseudorandom Function / Theoretical computer science / Cryptography / Applied mathematics


An Improved Pseudorandom Generator Based on Hardness of Factoring Nenad Dedi´c Boston University
Add to Reading List

Document Date: 2002-08-27 12:28:51


Open Document

File Size: 162,54 KB

Share Result on Facebook

Company

QRN / Background We / /

Country

United States / /

Currency

pence / /

/

Holiday

Assumption / /

IndustryTerm

reduction algorithm / n-bit products / computing / efficient algorithm / direct product / deterministic polynomial-time algorithm / probabilistic polynomial-time algorithm / /

Organization

Harvard University / Boston University / /

Person

Leonid Reyzin / Nenad Dedi / /

/

Position

mp / extractor / General / /

Product

Siemens SX1 Cellular Phone / /

Technology

efficient algorithm / following algorithm / probabilistic polynomial-time algorithm / deterministic polynomial-time algorithm / reduction algorithm / /

SocialTag