Bit security as computational cost for winning games with high probability (Q6157548)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bit security as computational cost for winning games with high probability |
scientific article; zbMATH DE number 7684804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bit security as computational cost for winning games with high probability |
scientific article; zbMATH DE number 7684804 |
Statements
Bit security as computational cost for winning games with high probability (English)
0 references
12 May 2023
0 references
bit security
0 references
Rényi divergence
0 references
Goldreich-Levin theorem
0 references
0 references
0 references
0.8680729
0 references
0.85097355
0 references
0.8494282
0 references
0 references
0.8369028
0 references
0.8206285
0 references
