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 this page instead for the normal view: A tight bound for exhaustive key search attacks against Message Authentication Codes |
scientific article; zbMATH DE number 6176635
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
