Back to Results
First PageMeta Content
Probabilistic complexity theory / Polynomials / Pseudorandom number generator / Randomized algorithm / IP / Coding theory / Sipser–Lautemann theorem / Normal distribution / Theoretical computer science / Mathematics / Computational complexity theory


Secure PRNGs from Specialized Polynomial Maps over Any Fq Michael Feng-Hao Liu∗
Add to Reading List

Document Date: 2007-10-22 14:34:16


Open Document

File Size: 417,07 KB

Share Result on Facebook

City

Taipei / /

Company

AES / Lazard / uPi / /

Country

Taiwan / United States / Sudan / /

Currency

pence / /

/

Facility

Brown University / Institute of Information Science / University of Cincinnati / /

IndustryTerm

mean feasible computing resources / compression using polynomials systems / polynomial systems / to overdetermined systems / probabilistic algorithm / inner product / sparse systems / /

Organization

University of Cincinnati / Brown University / Department of Computer Science / Institute of Information Science / U.S. Securities and Exchange Commission / Department of Mathematical Sciences / /

Person

Sparse-Rotated Quadratics / Chi-Jen Lu / Sparse Multivariate Polynomials / Michael Feng-Hao Liu / /

Position

Prime Minister / multivariate polynomial system problem MP / /

Product

F16 / /

RadioStation

Fm 2 / /

Technology

algorithm A. Algorithm / BBS / screening algorithm / stream cipher / probabilistic algorithm / /

SocialTag