On the Influence of Message Length in PMAC’s Security Bounds

DOI10.1007/978-3-662-49890-3_23zbMath1385.94057OpenAlexW2487355103MaRDI QIDQ2820498

Atul Luykx, Bart Preneel, Alan Szepieniec, Kan Yasuda

Publication date: 9 September 2016

Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://www.cosic.esat.kuleuven.be/publications/article-2581.pdf

zbMATH Keywords

verificationunforgeabilityintegrityPMACbirthday boundtagmessage length

Mathematics Subject Classification ID

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

Related Items (2)

Optimal forgeries against polynomial-based MACs and GCM ⋮ Revisiting Full-PRF-Secure PMAC and Using It for Beyond-Birthday Authenticated Encryption

This page was built for publication: On the Influence of Message Length in PMAC’s Security Bounds