Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
January 1, 1999SIAM Journal on Computing

A Pseudorandom Generator from any One-way Function

View Full Paper
Ask AI
Bookmark
Share

Authors

JHJohan HåstadKTH Royal Institute of TechnologyRIRussell ImpagliazzoUniversity of California, San DiegoLLLeonid A. LevinBoston University

Discussion

Loading...

Member takes

Implication

Key Points

Key points are not available for this paper at this time.

Cite This Study

Håstad et al. (1999) studied this question.

synapsesocial.com/papers/6a13dc862398cfa26a891790https://doi.org/10.1137/s0097539793244708
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1The Knowledge Complexity of Interactive Proof Systems1989 · 3,276 citations
  2. 2One-way functions are necessary and sufficient for secure signatures1990 · 699 citations
  3. 3A complexity theoretic approach to randomness1983 · 466 citations