Abstract Parallel computing has led to fundamental changes in almost all research areas associated with computer science; cryptography is no exception. Besides improved speed and resource utilization, parallel cryptography is also promising from the security point of view. In particular, cryptographic hash functions (CHFs) – “the swiss knife” of the cryptography toolkit – stand to gain a lot from parallelism. Consequently, there has been an increasing interest in research towards the development of parallel CHFs for faster, more secure and more efficient hashing, particularly since the competition for the SHA-3 standard. This paper attempts to consolidate the research efforts in the field of parallel hashing, exploring various approaches in this direction. Within each approach discussed in the article, CHFs have been classified on the basis of construction and their design, implementation and performance have been explained, with the primary focus on parallelism. Finally, a broad temporal overview of the developments in the field of parallel hashing has been presented.

中文翻译：

---

并行加密散列：过去 25 年的发展

摘要 并行计算导致几乎所有与计算机科学相关的研究领域发生了根本性的变化。密码学也不例外。除了提高速度和资源利用率外，从安全角度来看，并行密码学也很有前景。特别是，加密哈希函数 (CHF)——加密工具包的“瑞士刀”——可以从并行性中获益良多。因此，人们对开发并行 CHF 以实现更快、更安全和更高效的散列的研究越来越感兴趣，尤其是在 SHA-3 标准的竞争之后。本文试图巩固并行哈希领域的研究成果，探索该方向的各种方法。在文章中讨论的每种方法中，CHF 已根据构造进行分类，并解释了它们的设计、实现和性能，主要关注并行性。最后，对并行散列领域的发展进行了广泛的时间概述。