A Tight Bound for Exhaustive Key Search Attacks Against Message Authentication Codes
RAIRO - Theoretical Informatics and Applications - France
doi 10.1051/ita/2012025
Full Text
Open PDFAbstract
Available in full text
Date
November 6, 2012
Authors
Publisher
EDP Sciences