A Tight Bound for Exhaustive Key Search Attacks Against Message Authentication Codes

RAIRO - Theoretical Informatics and Applications - France
doi 10.1051/ita/2012025

Related search