A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch (Q3408197): Difference between revisions
From MaRDI portal
Latest revision as of 12:21, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch |
scientific article |
Statements
A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch (English)
0 references
24 February 2010
0 references
0 references
