A tight bound for exhaustive key search attacks against Message Authentication Codes

DOI10.1051/ita/2012025zbMath1316.94106OpenAlexW2034420383WikidataQ122397968 ScholiaQ122397968MaRDI QIDQ4928766

Davidson R. Boccardo, Luiz Fernando Rust, Raphael C. S. Machado, Vinícius G. Pereira de Sá

Publication date: 18 June 2013

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2013__47_2_171_0/

zbMATH Keywords

cryptographyasymptotic analysismessage authentication code

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

This page was built for publication: A tight bound for exhaustive key search attacks against Message Authentication Codes