A Proof of Security in O(2 n ) for the Xor of Two Random Permutations (Q5502805)
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: A Proof of Security in O(2 n ) for the Xor of Two Random Permutations |
scientific article; zbMATH DE number 5488469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Proof of Security in O(2 n ) for the Xor of Two Random Permutations |
scientific article; zbMATH DE number 5488469 |
Statements
A Proof of Security in O(2 n ) for the Xor of Two Random Permutations (English)
0 references
9 January 2009
0 references
pseudorandom functions
0 references
pseudorandom permutations
0 references
security beyond the birthday bound
0 references
Luby-Rackoff backwards
0 references
0.9318740963935852
0 references
0.9207995533943176
0 references
0.892230212688446
0 references
0.8864006996154785
0 references
