Skip to main content
SpringerLink
Log in

A Novel Hash Function Based on Multi-iterative Parallel Structure

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Hash functions serve as a fundamental cryptographic primitives and are used in numerous security fields, such as cloud audit, digital signature, block chain and random number generation. Recent years, cryptographers have long delved into parallel hash functions to design more efficient cryptographic primitives. This paper proposes a multi-iterative parallel hash function. Moreover, inside this parallel structure, a four branch parallel compression structure is proposed to accelerate message diffusion. Simulation results show the proposed hash scheme has great performance on both efficiency and security.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

Data availability

The data of this study are available from the corresponding author on reasonable request.

Code availability

The code of this study are available from the corresponding author on reasonable request.

References

  1. Boer, B. D., & Bosselaers, A. (1993). Collisions for the compression function of MD5. Eurocrypt, 765, 293–304.

    MATH  Google Scholar 

  2. Dobbertin, H. (1996). Cryptanalysis of MD5 compress. Presented at the rump session of Eurocrypt 1996.

  3. Wang, X., Yin, Y., & Yu, H. (2005). Finding collisions in the full SHA-1. Lecture Notes in Computer ScienceIn V. Shoup (Ed.), Advances in cryptology-CRYPTO2005 (Vol. 3621, pp. 17–36). Springer.

    Google Scholar 

  4. Chabaud, F., & Joux, A. (1998). Differential collisions in SHA-0. Crypto, 1462, 56–71.

    MATH  Google Scholar 

  5. Chu, C. K., Zhu, W. T., Han, J., Liu, J. K., Xu, J., & Zhou, J. (2013). Security concerns in popular cloud storage services. IEEE Pervasive Computing, 12(4), 50–57.

    Article  Google Scholar 

  6. Merkel, R. C. (1990). One way hash functions and DES. Advances in Cryptology CRYPTO 89, 435, 428–446.

    Article  MathSciNet  Google Scholar 

  7. Damgard, I. B. (1990). A design principle for hash functions. Advances in Cryptology CRYPTO 89, 435, 416–427.

    Article  MathSciNet  MATH  Google Scholar 

  8. Liang, J., & Lai, X. (2005). Improved collision attack on hash function MD5. In: Technical Report.

  9. Sasaki, Y., Naito, Y., Kunihiro, N., & Ohta, K. (2007). Improved collision attacks on MD4 and MD5. IEICE Transactions, 90-A(1), 37–47.

    Google Scholar 

  10. Stevens, M. (2013). New collision attacks on SHA-1 based on optimal joint local-collision analysis. In: Advances in Cryptology-Eurocrypt 2013, Lecture Notes in Computer Science, 7881, 245–261.

  11. Wang, X., Feng, D., Lai, X., & Yu, H. (2004). Collisions for hash functions MD4, MD5, HAVAL-128 and RIPEMD. Cryptology ePrint Archive, Report 2004/199.

  12. Li, W., Gao, Z., & Gu, D. (2017). Security analysis of whirlpool hash function in the cloud of things. KSII Transactions on Internet and Information Systems., 11(1), 536–551.

    Google Scholar 

  13. Mendel, F., Nad, T., & Schlaffer, M. (2013). Improving local collisions: New attacks on reduced SHA-256. Lecture Notes in Computer ScienceIn T. Johansson & P. Nguyen (Eds.), Advances in cryptology-EUROCRYPT2013 (Vol. 7881, pp. 262–278). Springer.

    Google Scholar 

  14. Lee, J., & Hong, D. (2012). Collision resistance of the JH hash function. IEEE Transactions of Information Theory, 58(3), 1992–1995.

    Article  MathSciNet  MATH  Google Scholar 

  15. Lucks, S. (2005). A failure-friendly design principle for hash functions. Asiacrypt, 3788, 474–494.

    MathSciNet  MATH  Google Scholar 

  16. Biham, E., & Dunkelman, O. (2007). A framework for iterative hash functions—HAIFA. Cryptology ePrint Archive: Report 2007/278.

  17. Bertoni, G., Daeman, J., & Peeters, M. (2007). Sponge functions. ECRYPT Hash Workshop. http://www.csrc.nist.gov/pki/HashWorkshop/PublicComments/2007May.html

  18. Je, S. T., Azman, S., & Amir, A. (2015). Parallel chaotic hash function based on the shuffle-exchange network. Nonlinear Dynamics, 81, 1067–1079.

    Article  Google Scholar 

  19. Wang, Y., Wong, K. W., & Xiao, D. (2011). Parallel hash function construction based on coupled map lattices. Communications in Nonlinear Science and Numerical Simulation, 16(7), 2810–2821.

    Article  MathSciNet  MATH  Google Scholar 

  20. Nouri, M., Safarinia, M., & Pourmahdi, P. (2014). The parallel one-way hash function based on Chebyshev-Halley methods with variable parameter. International Journal of Computers Communications & Control, 9(1), 24–36.

    Article  Google Scholar 

  21. Yang, Y., Chen, F., Chen, J., Zhang, Y., & Yung, K. L. (2019). A secure hash function based on feedback iterative structure. Enterprise Information Systems., 13(3), 281–302.

    Article  Google Scholar 

  22. Guesmi, R., Farah, M., & Kachouri, A. (2016). A novel chaos-based image encryption using DNA sequence operation and Secure Hash Algorithm SHA-2. Nonlinear Dynamics, 83, 1123–1136.

    Article  MathSciNet  MATH  Google Scholar 

  23. Kanso, A., & Ghebleh, M. (2015). A structure-based chaotic hashing scheme. Nonlinear Dynamics, 81, 27–40.

    Article  MathSciNet  MATH  Google Scholar 

  24. Ye, G., Zhao, H., & Chai, H. (2016). Chaotic image encryption algorithm using wave-line permutation and block diffusion. Nonlinear Dynamics, 83, 2067–2077.

    Article  MathSciNet  Google Scholar 

  25. Salvatore, P., Pedro, R., & Juan, A. M. (2016). Parallel d-pipeline: A Cuckoo hashing implementation for increased throughput. IEEE Transactions on Computers, 65(1), 326–331.

    Article  MathSciNet  MATH  Google Scholar 

  26. Meysam, A., Shahram, J., & Narjes, N. (2016). A novel keyed parallel hashing scheme based on a new chaotic system. Chaos, Solitions and Fractals, 87, 216–225.

    Article  MATH  Google Scholar 

  27. Yang, Y., Chen, F., Sun, Z., Wang, S., & Chen, J. (2019). Secure and efficient parallel hash function construction and its application on cloud audit. Soft Computing, 23(18), 8907–8925.

    Article  Google Scholar 

  28. Gauravaram, P., Millan, W., & Nieto, J. G. (2005). 3C—A provably secure pseudorandom function and message authentication code. A new mode of operation for cryptographic hash function. Annals of the New York Academy of Sciences, 2005(1), 491–494.

    Google Scholar 

  29. Liskov, M. (2006). Constructing an ideal hash function from weak ideal compression functions. In The proceedings of the 13th international conference on selected areas in cryptography. Montreal, Canada. Springer-Verlag, 2006 (pp. 358–375).

  30. Yang, Y., & Chen, F. (2017). Research on the hash function structures and its application. Wireless Personal Communications, 94(4), 2969–2985.

    Article  Google Scholar 

Download references

Funding

This work was supported by Shenzhen Polytechnic Youth Innovation Project under Grant 6019310007K0, 6021310008K, Guangdong Rural Science and Technology Commissioner Project under Grant No. KTP20200226, Science and Technology Innovation Projects of Shenzhen under Grant Nos. JCYJ20210324100813034, JCYJ20190809152003992, and the National Natural Science Foundation of China under Grant 62102268.

Author information

Authors and Affiliations

  1. School of Artificial Intelligence, Shenzhen Polytechnic, Shenzhen, 518060, Guangdong, China

    Yijun Yang & Xiayan Zhang

  2. Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ), Shenzhen, 518060, Guangdong, China

    Yijun Yang & Xiayan Zhang

  3. College of Computer and Software Engineering, Shenzhen University, Shenzhen, 518060, Guangdong, China

    Yijun Yang

Authors
  1. Yijun Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiayan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiayan Zhang.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yang, Y., Zhang, X. A Novel Hash Function Based on Multi-iterative Parallel Structure. Wireless Pers Commun 127, 2979–2996 (2022). https://doi.org/10.1007/s11277-022-09906-5

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-022-09906-5

Keywords

Search

Navigation