NEW PSEUDO NEAR COLLISION ATTACK ON TIGER

Dibyendu Mallik, Debdeep Mukhopadhyay

2010

Abstract

Tiger is a cryptographic hash function created by Anderson and Biham in 1996 with hash value of 192 bits. Reduced round variants of Tiger have shown some weaknesses recently. Kelsey and Lucks have shown a collision attack on Tiger reduced to round 16 and 17. Mendel and Rijmen have found 1 bit pseudo near collision for full round Tiger. In this article we discover a new key schedule differential for Tiger which leads to the finding of message pairs for 1-bit pseudo near collision.

Paper Citation

in Harvard Style

Mallik D. and Mukhopadhyay D. (2010). NEW PSEUDO NEAR COLLISION ATTACK ON TIGER . In Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2010) ISBN 978-989-8425-18-8, pages 427-430. DOI: 10.5220/0002940104270430

in Bibtex Style

@conference{secrypt10,
author={Dibyendu Mallik and Debdeep Mukhopadhyay},
title={NEW PSEUDO NEAR COLLISION ATTACK ON TIGER},
booktitle={Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2010)},
year={2010},
pages={427-430},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002940104270430},
isbn={978-989-8425-18-8},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2010)
TI - NEW PSEUDO NEAR COLLISION ATTACK ON TIGER
SN - 978-989-8425-18-8
AU - Mallik D.
AU - Mukhopadhyay D.
PY - 2010
SP - 427
EP - 430
DO - 10.5220/0002940104270430