Improving the message expansion of the tangle hash function

Authors:
Rafael Álvarez;José-Francisco Vicent;Antonio Zamora
Affiliations:
Dpto. de Ciencia de la Computación e Inteligencia Artificial, Universidad de Alicante, Alicante, Spain;Dpto. de Ciencia de la Computación e Inteligencia Artificial, Universidad de Alicante, Alicante, Spain;Dpto. de Ciencia de la Computación e Inteligencia Artificial, Universidad de Alicante, Alicante, Spain
Venue:
CISIS'11 Proceedings of the 4th international conference on Computational intelligence in security for information systems
Year:
2011

Citing 3
Cited 0

Weighted sum codes for error detection and their comparison with existing codes

IEEE/ACM Transactions on Networking (TON)
The Design of Rijndael

The Design of Rijndael
Merkle-Damgård revisited: how to construct a hash function

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tangle is an iterative one-way hash function based on the Merkle-Damgard scheme strengthened by a message dependent round function. Itwas 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.