High performance GHASH function for long messages

DOI10.1007/978-3-642-13708-2_10MaRDI QIDQ3575044zbMATH OpenOpenAlexFDO

Authors Nicolas Meloni, Christophe Negre, M. Anwar Hasan

Publication date 6 July 2010

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13708-2_10

zbMATH Keywords

characteristic polynomialGalois/Counter modeGHASH function

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• The Security and Performance of “GCM” when Short Multiplications Are Used Instead
• Cycling attacks on GCM, GHASH and other polynomial MACs and hashes
• Progress in Cryptology - INDOCRYPT 2004
• Faster binary-field multiplication and faster binary-field macs
• Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm

This page was built for publication: High performance GHASH function for long messages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575044)