A tight bound for exhaustive key search attacks against message authentication codes (Q4928766)
From MaRDI portal
!
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 6176635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight bound for exhaustive key search attacks against message authentication codes |
scientific article; zbMATH DE number 6176635 |
Statements
A tight bound for exhaustive key search attacks against Message Authentication Codes (English)
0 references
18 June 2013
0 references
cryptography
0 references
message authentication code
0 references
asymptotic analysis
0 references
0.7764242887496948
0 references
0.7676184773445129
0 references
0.7626816630363464
0 references
