Paper 2014/170

Parallelized hashing via j-lanes and j-pointers tree modes, with applications to SHA-256

Shay Gueron

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.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Preprint. MINOR revision.
Keywords
Tree mode hashingSHA-256SIMD architectureAdvanced Vector Extensions architecturesAVXAVX2.
Contact author(s)
shay @ math haifa ac il
History
2014-03-04: received
Short URL
https://ia.cr/2014/170
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/170,
      author = {Shay Gueron},
      title = {Parallelized hashing via j-lanes and j-pointers tree modes, with applications to SHA-256},
      howpublished = {Cryptology ePrint Archive, Paper 2014/170},
      year = {2014},
      note = {\url{https://eprint.iacr.org/2014/170}},
      url = {https://eprint.iacr.org/2014/170}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.