Welcome to the resource topic for 2013/212
Title:
A Closer Look at HMAC
Authors: Krzysztof Pietrzak
Abstract:Bellare, Canetti and Krawczyk~\cite{FOCS:BelCanKra96} show that cascading an \eps-secure (fixed input length) PRF gives an O(\eps n q)-secure (variable input length) PRF when making at most q prefix-free queries of length n blocks. We observe that this translates to the same bound for NMAC (which is the cascade without the prefix-free requirement but an additional application of the PRF at the end), and give a matching attack, showing this bound is tight. This contradicts the O(\eps n) bound claimed by Koblitz and Menezes~\cite{KobMen12}.
ePrint: https://eprint.iacr.org/2013/212
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .