Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,308,753 papers from all fields of science
Search
Sign In
Create Free Account
Pseudorandom ensemble
Let be a uniform ensembleand be an ensemble. The ensemble is called pseudorandom if and are indistinguishable in polynomial time.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Broader (2)
Algorithmic information theory
Cryptography
Distribution ensemble
Pseudorandomness
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2002
2002
A comparison of two approaches to pseudorandomness
Yongge Wang
Theoretical Computer Science
2002
Corpus ID: 14371503
2000
2000
CORR 2000-12 A Comparison of Two Approaches to Pseudorandomness
Yongge Wang
2000
Corpus ID: 54081532
The concept of pseudorandomness plays an important role in cryptography. In this note we contrast the notions of complexity…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required