Skip to main content
SpringerLink
Log in

A New Modified MD5-224 Bits Hash Function and an Efficient Message Authentication Code Based on Quasigroups

  • Conference paper
  • First Online:
Cyber Security, Privacy and Networking

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 370))

Abstract

In this paper, we have proposed  (i) a hash function and (ii) an efficient message authentication code based on quasigroup. We refer to these as QGMD5 and QGMAC, respectively. The proposed new hash function QGMD5 is an extended version of MD5 that uses an optimal quasigroup along with two operations named as QGExp and QGComp. The operations quasigroup expansion (QGExp) and the quasigroup compression (QGComp) are also defined in this paper. QGMAC is designed using the proposed hash function QGMD5 and a quasigroup of order 256 as the secret key. The security of QGMD5 is analyzed by comparing it with both the MD5 and the SHA-244. It is found that the proposed QGMD5 hash function is more secure. Also, QGMAC is analyzed against the brute-force attack. It is resistant to this attack because of the exponential number of quasigroups of its order. It is also analyzed for the forgery attack, and it is found to be resistant. In addition, we compared the performance of the proposed hash function to that of the existing MD5 and SHA-224. Similarly, the performance of the proposed QGMAC is compared with that of the existing HMAC-MD5 and HMAC-SHA-224. The results show that the proposed QGMD5 would take around 2 \(\mu s\) additional execution time from that of MD5 but not more than SHA-224, while QGMAC always takes less time than that of both the HMAC-MD5 and the HMAC-SHA-224. So, our schemes can be deployed in all the applications of hash functions, such as in blockchain and for verifying the integrity of messages.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 219.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Denes J, Keedwell AD (1991) Latin squares: new developments in the theory and applications, vol. 46. Elsevier

    Google Scholar 

  2. Farhan D, Ali M (2015) Enhancement MD5 depend on multi techniques. Int J Softw Eng

    Google Scholar 

  3. Gupta DR (2020) A Review paper on concepts of cryptography and cryptographic hash function. Eur J Mol Clin Med 7(7):3397–408 Dec 24

    Google Scholar 

  4. https://crackstation.net/crackstation-wordlist-password-cracking-dictionary.htm

  5. https://en.wikipedia.org/wiki/Dictionary_attack

  6. https://en.cppreference.com/w/cpp/chrono

  7. https://www.onlinehashcrack.com

  8. Ilaiyaraja M, BalaMurugan P, Jayamala R (2014) Securing cloud data using cryptography with alert system. Int J Eng Res 3(3)

    Google Scholar 

  9. Jacobson MT, Matthews P (1996) Generating uniformly distributed random Latin squares. J Combinator Des 4(6):405–437

    MathSciNet  MATH  Google Scholar 

  10. Leander G, Poschmann A (2007) On the classification of 4 bit S-Boxes. In: Proceedings of the 1st international workshop on arithmetic of finite fields. Springer, Berlin, pp 159–176

    Google Scholar 

  11. Maliberan EV, Sison AM, Medina RP (2018) A new approach in expanding the hash size of MD5. Int J Commun Netw Inf Secur 10(2):374–379

    Google Scholar 

  12. Meyer KA (2006) A new message authentication code based on the non-associativity of quasigroups

    Google Scholar 

  13. Mihajloska H, Gligoroski D (2012) Construction of optimal 4-bit S-boxes by quasigroups of order 4. In: The sixth international conference on emerging security information, systems and technologies, SECURWARE

    Google Scholar 

  14. Noura HN, Melki R, Chehab A, Fernandez Hernandez J (2020) Efficient and secure message authentication algorithm at the physical layer. Wireless Netw 9:1–5 Jun

    Google Scholar 

  15. Paar C, Pelzl J (2009) Understanding cryptography: a textbook for students and practitioners. Springer Science & Business Media

    Google Scholar 

  16. Rivest R (1992) The MD5 message-digest algorithm. RFC:1321

    Google Scholar 

  17. Selvi D, Velammal TG (2014) Modified method of generating randomized Latin squares. IOSR J Comput Engi (IOSR-JCE) 16:76–80

    Google Scholar 

  18. Stevens M (2007) Master’s Thesis, On collisions for MD5

    Google Scholar 

  19. Theoharoulis K, Papaefstathiou I (2010) Implementing rainbow tables in high end FPGAs for superfast password cracking. In: International conference on field programmable logic and applications

    Google Scholar 

  20. Zhang J, Wang X, Zhang W (2007) Chaotic keyed hash function based on feedforward-feedback nonlinear digital filter. Phys Lett A 362(5–6):439–448

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer & Information Sciences, University of Hyderabad, Hyderabad, India

    Umesh Kumar & V. Ch. Venkaiah

Authors
  1. Umesh Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Ch. Venkaiah
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Umesh Kumar .

Editor information

Editors and Affiliations

  1. University of Cincinnati, Cincinnati, OH, USA

    Dharma P. Agrawal

  2. State University of Rio de Janeiro, Rio de Janeiro, Brazil

    Nadia Nedjah

  3. Department of Computer Science and Information Engineering, Asia University, Taichung, Taiwan

    B. B. Gupta

  4. University of Murcia, Murcia, Spain

    Gregorio Martinez Perez

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kumar, U., Venkaiah, V.C. (2022). A New Modified MD5-224 Bits Hash Function and an Efficient Message Authentication Code Based on Quasigroups. In: Agrawal, D.P., Nedjah, N., Gupta, B.B., Martinez Perez, G. (eds) Cyber Security, Privacy and Networking. Lecture Notes in Networks and Systems, vol 370. Springer, Singapore. https://doi.org/10.1007/978-981-16-8664-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-8664-1_1

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-8663-4

  • Online ISBN: 978-981-16-8664-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation