Skip to main content
  • 1099 Accesses

Abstract

Hash functions used to provide integrity and authentication on messages sent over unsecure network. There are two most commonly used hash and MD algorithms: SHA-1 and MD5, which are vulnerable to collision attack. The weakness of these hash algorithms is that sometimes two different inputs will produce the same hash as output. To reduce this collision attack there is need to have a better hash algorithm so that the output in each round will be different and not to be equal with the same output in the next coming stages. In this paper, modified SHA-192 is implemented having a message digests of length 192 and we have also compared the security analysis of famous secure hash algorithm with enhanced SHA-192.

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 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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. Tiwari, H., Asawa, Dr.: A secure hash function MD-192 with modified message expansion. Int. J. Comput. Sci. Inf. Secur. 7(2) (2010)

    Google Scholar 

  2. Turner, S., Chen, L.: Updated security considerations for the MD5 message-digest and the HMAC-MD5 algorithms. IETF (2011)

    Google Scholar 

  3. Gupta, G., Sharma, S.: Enhanced SHA192 algorithm with larger bit difference. In: International Conference on Communication Systems and Network Technologies. IEEE (2013)

    Google Scholar 

  4. Srinivas, S., Yeligati, S.: FPGA implementation of Proposed SHA-192 algorithm for digital signature application. Int. J. Emerg. Eng. Res. Technol. 2(4) (2014)

    Google Scholar 

  5. Lakshmanan, T., Muthusamy, M.: A novel secure hash algorithm for public key digital signature schemes. Arab J. Inf. Technol. 9(3) (2012)

    Google Scholar 

  6. Garg, P., Tiwari, N.: Performance analysis of SHA algorithms (SHA-1 and SHA-192): a review. IJCTEE 2(3) (2012)

    Google Scholar 

  7. Xiao-hui, C., Jian-zhi, D.: Design of SHA-1 algorithm based on FPGA. In: IEEE Second International Conference on Networks Security, Wireless Communications and Trusted Computing, (NSWCTC), vol. 1, pp. 532–534 (2010)

    Google Scholar 

  8. Thulasmani, L., Madheswaran, M.: Security and robustness enhancement of existing Hash algorithm. In: International Conference on Signal Processing Systems. IEEE (2009)

    Google Scholar 

  9. Ming, H., Wang, Y.: The collision rate tests of two known message digest algorithms.In: International Conference on Computational Intelligence and Security, vol. 2. IEEE (2009)

    Google Scholar 

  10. Stallings, W.: Cryptography and Network Security, 4th edn. (2006)

    Google Scholar 

  11. Biham, E., Chen, R., Joux, A., Jalby,W.: Collisions of SHA-0 and reduced SHA-1. In: Advances in Cryptology. Springer, Berlin (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Harshita .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this paper

Cite this paper

Harshita, Sarvesh Tanwar (2016). Implementation and Performance Analysis of Enhanced SHA-192. In: Afzalpulkar, N., Srivastava, V., Singh, G., Bhatnagar, D. (eds) Proceedings of the International Conference on Recent Cognizance in Wireless Communication & Image Processing. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2638-3_54

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2638-3_54

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2636-9

  • Online ISBN: 978-81-322-2638-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics