Faster 64-bit universal hashing using carry-less multiplications [r-libre/681]

Lemire, Daniel et Kaser, Owen (2016). Faster 64-bit universal hashing using carry-less multiplications. Journal of Cryptographic Engineering, 6 (3), 171-185. 10.1007/s13389-015-0110-5

Fichier(s) associé(s) à ce document :

PDF (Version de l'auteur) - 1503.03465v6.pdf
Licence : Creative Commons CC BY.

Télécharger

Catégorie de document :	Articles de revues
Évaluation par un comité de lecture :	Oui
Étape de publication :	Publié
Résumé :	Intel and AMD support the Carry-less Multiplication (CLMUL) instruction set in their x64 processors. We use CLMUL to implement an almost universal 64-bit hash family (CLHASH). We compare this new family with what might be the fastest almost universal family on x64 processors (VHASH). We find that CLHASH is at least 60% faster. We also compare CLHASH with a popular hash function designed for speed (Google's CityHash). We find that CLHASH is 40% faster than CityHash on inputs larger than 64 bytes and just as fast otherwise.
Adresse de la version officielle :	http://link.springer.com/article/10.1007/s13389-01...
Déposant:	Lemire, Daniel
Responsable :	Daniel Lemire
Dépôt :	17 aout 2015 13:23
Dernière modification :	05 aout 2016 13:57

Actions (connexion requise)

RÉVISER