Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
A New Variant of PMAC: Beyond the Birthday Bound
verfasst von : Kan Yasuda
Erschienen in: Advances in Cryptology – CRYPTO 2011
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We propose a PMAC-type mode of operation that can be used as a highly secure MAC (Message Authentication Code) or PRF (Pseudo-Random Function). Our scheme is based on the assumption that the underlying
n
-bit blockcipher is a pseudo-random permutation. Our construction, which we call
PMAC_Plus
, involves extensive modification to PMAC, requiring three blockcipher keys. The
PMAC_Plus
algorithm is a first rate-1 (
i.e.
, one blockcipher call per
n
-bit message block) blockcipher-based MAC secure against
$O\bigl(2^{2n/3}\bigr)$
queries, increasing the
$O\bigl(2^{n/2}\bigr)$
security of PMAC at a low additional cost. Our analysis uses some of the security-proof techniques developed with the sum construction (Eurocrypt 2000) and with the encrypted-CBC sum construction (CT-RSA 2010).