Skip to main content

Improving the Message Expansion of the Tangle Hash Function

  • Conference paper
Computational Intelligence in Security for Information Systems

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 6694))

Abstract

Tangle is an iterative one-way hash function based on the Merkle-Damgard scheme strengthened by a message dependent round function. It was submitted to the NIST SHA-3 competition, being accepted for first round evaluation. We propose an alternative message expansion scheme for Tangle in order to thwart the collision attacks found during such evaluation. Based on the fact that differences at the beginning of the expanded message contribute to better avalanche, the improved message expansion scheme presents much better properties than the original version while maintaining very good performance characteristics.

Partially supported by the grant GRE09-02 of the University of Alicante.

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. Daemen, J., Rijmen, V.: The Design of Rijndael: AES–the Advanced Encryption Standard. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  2. Alvarez, R., McGuire, G., Zamora, A.: The Tangle Hash Function. NIST SHA-3 Competition submission (2008)

    Google Scholar 

  3. Coron, J.-S., Dodis, Y., Malinaud, C., Puniya, P.: Merkle-Damgård Revisited: How to Construct a Hash Function. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 430–448. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Esmaeili, Y.: Some observations on Tangle. Observations on Tangle, NIST SHA-3 Competition (2008)

    Google Scholar 

  5. McAuley, A.J.: Weighted Sum Codes for Error Detection and Their Comparison with Existing Codes. IEEE/IACM Transactions on Networking 2-1, 16–22 (1994)

    Article  Google Scholar 

  6. Odoni, R.W.K., Varadharajan, V., Sanders, P.W.: Public Key Distribution in Matrix Rings. Electronic Letters 20, 386–387 (1984)

    Article  Google Scholar 

  7. National Institute of Standards and Technology: Secure Hash Standard (with change notice). Federal Information Processing Standards Publication FIPS-180-2 (2002)

    Google Scholar 

  8. NIST SHA-3 Competition Resources, http://csrc.nist.gov/groups/ST/hash/sha-3/index.html

  9. Thomsen, S.S.: Untangled. Observations on Tangle, NIST SHA-3 Competition (2008)

    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

Álvarez, R., Vicent, JF., Zamora, A. (2011). Improving the Message Expansion of the Tangle Hash Function. In: Herrero, Á., Corchado, E. (eds) Computational Intelligence in Security for Information Systems. Lecture Notes in Computer Science, vol 6694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21323-6_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21323-6_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21322-9

  • Online ISBN: 978-3-642-21323-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics