MMH: software message authentication in the Gbit/second rates. We describe a construction of almost universal hash functions suitable for very fast software implementation and applicable to the hashing of variable size data and fast cryptographic message authentication. Our construction uses fast single precision arithmetic which is increasingly supported by modern processors due to the growing needs for fast arithmetic posed by multimedia applications. par We report on hand-optimized assembly implementations on a 150 MHz PowerPC 604 and a 150 MHz Pentium-Pro, which achieve hashing speeds of 350 to 820 Mbit/sec, depending on the desired level of security (or collision probability), and a rate of more than 1 Gbit/sec on a 200 MHz Pentium-Pro. This represents a significant speed-up over current software implementations of universal hashing and other message authentication techniques (e.g., MD5-based). Moreover, our construction is specifically designed to take advantage of emerging microprocessor technologies (such as Intel’s MMX, 64-bit architectures and others) and then best suited to accommodate the growing performance needs of cryptographic (and other universal hashing) applications. par The construction is based on techniques due to Carter and Wegman for universal hashing using modular multilinear functions that we carefully modify to allow for fast software implementation. We prove the resultant construction to retain the necessary mathematical properties required for its use in hashing and message authentication.

References in zbMATH (referenced in 16 articles , 1 standard article )

Showing results 1 to 16 of 16.
Sorted by year (citations)

  1. Liu, Gang; Wang, Peng; Wei, Rong; Ye, Dingfeng: Revisiting construction of online cipher in hash-ECB-hash structure (2021)
  2. Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh; Tóth, László: On an almost-universal hash function family with applications to authentication and secrecy codes (2018)
  3. Jha, Ashwin; Nandi, Mridul: On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers (2018)
  4. Lee, Jooyoung; Luykx, Atul; Mennink, Bart; Minematsu, Kazuhiko: Connecting tweakable and multi-key blockcipher security (2018)
  5. Bibak, Khodakhast; Kapron, Bruce M.; Srinivasan, Venkatesh: MMH* with arbitrary modulus is always almost-universal (2016)
  6. Cogliati, Benoît; Seurin, Yannick: EWCDM: an efficient, beyond-birthday secure, nonce-misuse resistant MAC (2016)
  7. Nesterenko, A. Yu.: On a family of universal hash functions (2015)
  8. Procter, Gordon; Cid, Carlos: On weak keys and forgery attacks against polynomial-based MAC schemes (2015)
  9. Sarkar, Palash: Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector (2014)
  10. Sarkar, Palash: A new multi-linear universal hash family (2013)
  11. Minematsu, Kazuhiko; Iwata, Tetsu: Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal (2011)
  12. Sarkar, Palash: Tweakable enciphering schemes using only the encryption function of a block cipher (2011)
  13. Sarkar, Palash: A trade-off between collision probability and key size in universal hashing using polynomials (2011)
  14. Krovetz, Ted; Rogaway, Phillip: Variationally universal hashing (2006)
  15. Biham, Eli (ed.): Fast software encryption. 4th international workshop, FSE ’97, Haifa, Israel, January 20--22, 1997. Proceedings (1997)
  16. Halevi, Shai; Krawczyk, Hugo: MMH: software message authentication in the Gbit/second rates (1997)