Journal of Information Security
Volume 5, Issue 3 (July 2014)
ISSN Print: 2153-1234 ISSN Online: 2153-1242
Google-based Impact Factor: 3.79 Citations
Parallelized Hashing via j-Lanes and j-Pointers Tree Modes, with Applications to SHA-256 ()
Affiliation(s)
ABSTRACT
j-lanes tree hashing is a tree mode that splits an input message into j slices, computes j independent digests of each slice, and outputs the hash value of their concatenation. 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 expose parallelization opportunities in a hashing process that is otherwise serial by nature. As a result, they have a performance advantage on modern processor architectures. This paper provides precise specifications for these hashing modes, proposes appropriate IVs, and demonstrates their performance on the latest processors. Our hope is that it would be useful for standardization of these modes.
KEYWORDS
Share and Cite:
Cited by
Copyright © 2024 by authors and Scientific Research Publishing Inc.
This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.