Skip to main content

A Fast and Secure One-Way Hash Function

  • Conference paper
Security Technology (SecTech 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 259))

Included in the following conference series:

Abstract

One way hash functions play a fundamental role for data integrity, message authentication, and digital signature in modern information security. In this paper we proposed a fast one-way hash function to optimize the time delay with strong collision resistance, assures a good compression and one-way resistance. It is based on the standard secure hash function (SHA-1) algorithm. The analysis indicates that the proposed algorithm which we called (fSHA-1) is collision resistant and assures a good compression and pre-image resistance. In addition, the executing time compared with the standard secure hash function is much shorter.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. He, W., Peng, X., Qin, W., Meng, X.: The keyed optical hash function based on cascaded phase-truncated fourier transforms. Optics Communications 283, 2328–2332 (2010)

    Article  Google Scholar 

  2. Zhen, W., Guo, Z., Hong, W., Yu, Z., Lei, L., Yu, Z.: Design theory and method of multivariate hash function. Information Sciences 53, 1977–1987 (2010)

    MathSciNet  Google Scholar 

  3. Andreeva, E., Preneel, B.: A Three-Property-Secure Hash Function. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol. 5381, pp. 228–244. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Seoa, M., Haitsmab, J., Kalkerb, T., Yooa, C.: A robust image fingerprinting system using the radon transform. Signal Processing: Image Communication 19(4), 325–339 (2004)

    Google Scholar 

  5. Tiwari, H.: Cryptographic hash function: an elevated view. European Journal of Scientific Research 43, 452–465 (2010)

    Google Scholar 

  6. Tiwari, H., Asawa, K.: A secure hash function MD-192 with modified message expansion. International Journal of Computer Science and Information Security VII(II) (2010)

    Google Scholar 

  7. Eastlake, D., Jones, P.: US secure hash algorithm 1 (SHA-1), Network Working Group, Category: Informational, pp.1-22 (2001)

    Google Scholar 

  8. Pongyupinpanich, S., Choomchuay, S.: An architecture for a SHA-1 applied for DSA. In: Proceeding of 3rd Asian International Mobile Computing Conference (AMOC), Thailand, May 26-28, pp. 8–12 (2004)

    Google Scholar 

  9. Secure hash standard, United States of American, National Institute of Science and Technology, Federal Information Processing Standard (FIPS) 180-1 (April 1995)

    Google Scholar 

  10. Szydlo, M., Yin, Y.L.: Collision-Resistant Usage of MD5 and SHA-1 via Message Preprocessing. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol. 3860, pp. 99–114. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  11. Wang, X., Yu, H., Yin, Y.L.: Efficient Collision Search Attacks on SHA-0. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 1–16. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Cochran, M.: Notes on the wang et al. 263 SHA-1 differential path. Cryptology ePrint Archive, Report 2007/474 (2007), http://eprint.iacr.org/

  13. Secure hash standard, National Institute of Science and Technology (NIST), Federal Information Processing Standards Publications (FIPS PUB) 180-2 (2002)

    Google Scholar 

  14. Sugita, M., Kawazoe, M., Perret, L., Imai, H.: Algebraic cryptanalysis of 58-round SHA-1. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 349–365. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

El Bakrawy, L.M., Ghali, N.I., Hassanien, A.E., Kim, TH. (2011). A Fast and Secure One-Way Hash Function. In: Kim, Th., Adeli, H., Fang, Wc., Villalba, J.G., Arnett, K.P., Khan, M.K. (eds) Security Technology. SecTech 2011. Communications in Computer and Information Science, vol 259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27189-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27189-2_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27188-5

  • Online ISBN: 978-3-642-27189-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics