On the Complexity of Breaking Pseudoentropy (Q2988853)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6721547
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Complexity of Breaking Pseudoentropy |
scientific article; zbMATH DE number 6721547 |
Statements
On the Complexity of Breaking Pseudoentropy (English)
0 references
19 May 2017
0 references
nonuniform attacks
0 references
pseudoentropy
0 references
smooth entropy
0 references
hardness of Boolean functions
0 references
0 references
0 references
0.82819253
0 references
0.82257175
0 references
0.81473494
0 references
0.8079658
0 references
0.8075149
0 references
0.80516183
0 references
0 references
0.8036908
0 references
0 references
0.80039716
0 references
