How many queries are needed to distinguish a truncated random permutation from a random function? (Q1747661)
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: How many queries are needed to distinguish a truncated random permutation from a random function? |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How many queries are needed to distinguish a truncated random permutation from a random function? |
scientific article |
Statements
How many queries are needed to distinguish a truncated random permutation from a random function? (English)
0 references
26 April 2018
0 references
pseudo-random permutations
0 references
pseudo-random functions
0 references
advantage
0 references
0.8814874291419983
0 references
0.830839991569519
0 references
0.787412166595459
0 references
0.7684987783432007
0 references
0.744648814201355
0 references
