Cryptology ePrint Archive: Report 2014/170
Parallelized hashing via j-lanes and j-pointers tree modes, with applications to SHA-256
Abstract: The j-lanes tree hashing is a tree mode that splits an input message to j slices, computes j independent digests of each slice, and outputs the hash value of their concatenation. The j-pointers tree hashing is a similar tree mode that receives, as input, j pointers to j messages (or slices of a single message), computes their digests and outputs the hash value of their concatenation. Such modes have parallelization capabilities on a hashing process that is serial by nature. As a result, they have performance advantage on modern processor architectures. This paper provides precise specifications for these hashing modes, proposes a setup for appropriate IVís definition, and demonstrates their performance on the latest processors. Our hope is that it would be useful for standardization of these modes.
Category / Keywords: implementation / Tree mode hashing, SHA-256, SIMD architecture, Advanced Vector Extensions architectures, AVX, AVX2.
Date: received 3 Mar 2014
Contact author: shay at math haifa ac il
Available format(s): PDF | BibTeX Citation
Version: 20140304:073912 (All versions of this report)
Short URL: ia.cr/2014/170
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]