Skip to main content

An Expert Sequential Shift-XOR-Based Hash Function Algorithm

  • Conference paper
  • First Online:
Emerging Trends in Expert Applications and Security ( ICE-TEAS 2023)

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

  • 240 Accesses

Abstract

In this technological world, all sorts of information transactions of governmental and non-governmental organizations are being done through internet. Everybody is using WhatsApp, Facebook, Instagram or other social sites. All the information that is floating on the internet is on high risk because of unethical practices of Internet users. So the cybercrime is a crucial matter among us. Information security is now challenging issue for global community. There are so many techniques comes under various security methods like data confidentiality, authentication, access control, data integrity, and more. Authentication is one of the most prominent security services. MD5 or SHA are the most popular cryptographic hash functions that are widely used in internet applications and protocols to provide authenticity. Their concept is very easy to implement and provides high level of security. In this paper, we have proposed a new construction of hash function scheme named SS-XORHF (Sequential Shift–XOR based Hash Function) for message authentication. Our scheme, SS-XORHF, is multifaceted so provide very complex hash code for authentication which gives strong security.

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

Access this chapter

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. Zhuoyu H, Yongzhen L (2022) Design and implementation of efficient hash functions. In: Published in IEEE 2nd International Conference on Power, Electronics and Computer Applications (ICPECA)

    Google Scholar 

  2. Ambedkar BR, Bharti PK, Husain A (2021) Design and analysis of hash algorithm using autonomous initial value proposed secure hash algorithm64. In: Published in IEEE 18th India Council International Conference (INDICON)

    Google Scholar 

  3. De Guzman FE, Gerardo BD, Medina RP (2019) Implementation of enhanced secure hash algorithm towards a secured web portal. In: Published in IEEE 4th International conference on computer and communication systems (ICCCS)

    Google Scholar 

  4. Mirvaziri H, Jumari K, Ismail M, Hanapi ZM (2007) A new hash function based on combination of existing digest algorithms. In: published in IEEE 5th Student Conference on Research and Development

    Google Scholar 

  5. Muller F (2004) The MD2 hash function is not one-way. ASIACRYPT.pp 214–229

    Google Scholar 

  6. http://en.wikipedia.org/wiki/MD2

  7. Den Boer B, Bosselaers A (1991) An attack on the last two rounds of MD4.

    Google Scholar 

  8. Dobbertin (1995) Cryptanalysis of MD4

    Google Scholar 

  9. Schneier on Security: Cryptanalysis of SHA-1 http://www.schneier.com/blog/archives/2005/02/cryptanalysis_o.html

  10. http://csrc.nist.gov/groups/ST/toolkit/secure_hashing.html

  11. Schneier on Security: NIST Hash Workshop Liveblogging (5) http://www.schneier.com/blog/archives/2005/11/nist_hash_works_4.html

  12. Hash cracked–heise Security http://www.heise-online.co.uk/security/Hash-cracked--/features/75686/2

  13. http://en.wikipedia.org/wiki/Secure_Hash_Algorithm

  14. Yavuz AA et al. (2019) Ultra lightweight multiple-time digital signature for the internet of things devices. Publ IEEE Trans Serv Comput (IEEE TSC)

    Google Scholar 

  15. Santini P et al. (2019) Cryptanalysis of a one-time code-based digital signature scheme. Publ IEEE Int Symp Inf Theory (ISIT)

    Google Scholar 

  16. Ali AM et al. (2020) A novel improvement with an effective expansion to enhance the md5 hash function for verification of a secure E-document. Publ IEEE Access 8:80290–80304

    Google Scholar 

  17. Samiullahet M et al (2020) An image encryption scheme based on dna computing and multiple chaotic systems. Published by IEEE Access 8:25650–25663

    Article  Google Scholar 

  18. De Guzman et al. (2019) Implementation of enhanced secure hash algorithm towards a secured web portal. 2019 IEEE 4th International conference on computer and communication systems, IEEE Xplore

    Google Scholar 

  19. Singh L et al. (2020) Secure data hiding techniques. Published by Multimedia Tools and Applications, pp 15901–15921

    Google Scholar 

  20. Ahmed AA, Ahmed WA (2019) An effective multifactor authentication mechanism based on combiners of hash function over internet of things. Published by Sensors MDPI. [online] Available https://doi.org/10.3390/s19173663

  21. Mitra P (2018) Recent advances in cryptography and network security. IntechOpen

    Google Scholar 

  22. Wang JY, Li YZ (2013) The design and realization of the single-block hash function for the short message. Appl Mech Mater 411–414:53–59

    Google Scholar 

Biblography

  1. Bellare M, Canetti R, Krawczyk H (1996) Keying hash functions for message authentication

    Google Scholar 

  2. Bellare, M., Canetti, R. and Krawczyk, H (1996) Keying hash functions for message authentication. In: Crypto 96 Proceedings, Lecture notes in computer science vol.1109. N. Koblitz ed., Springer-Verlag

    Google Scholar 

  3. Schheier B Applied cryptography, 2nd edition

    Google Scholar 

  4. Leuven KU, Mercierlaan K Cryptographic hash functions: an overview, vol 94. Bart Preneel1ESAT-COSIC Laboratory, B-3001 Leuven, Belgium

    Google Scholar 

  5. Preneel B (2003) Analysis and design of cryptographic hash functions

    Google Scholar 

  6. Safdari M, R Joshi (2009) Evolving universal hash functions using genetic algorithms. In: the Proceedings of the IEEE International Conference on Future Computer and Communication, pp 84- 87. ISBN: 978–0-7695–3591-3. 10.1109/ICFCC.2009.66

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sunita Bhati .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 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

Bhati, S., Bhati, A., Gaur, S. (2023). An Expert Sequential Shift-XOR-Based Hash Function Algorithm. In: Rathore, V.S., Tavares, J.M.R.S., Piuri, V., Surendiran, B. (eds) Emerging Trends in Expert Applications and Security. ICE-TEAS 2023. Lecture Notes in Networks and Systems, vol 681. Springer, Singapore. https://doi.org/10.1007/978-981-99-1909-3_42

Download citation

Publish with us

Policies and ethics