Abstract
We describe a parallel algorithm for extending a small domain hash function to a very large domain hash function. Our construction can handle messages of any practical length and preserves the security properties of the basic hash function. The construction can be viewed as a parallel version of the well known Merkle-Damgard construction, which is a sequential construction. Our parallel algorithm provides a significant reduction in the computation time of the message digest, which is a basic operation in digital signatures.
Author supplied keywords
Cite
CITATION STYLE
Sarkar, P., & Schellenberg, P. J. (2001). A parallel algorithm for extending cryptographic hash functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2247, pp. 40–49). Springer Verlag. https://doi.org/10.1007/3-540-45311-3_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
