On a Conditional Collision Attack on NaSHA-512

Markovski, Smile and Mileva, Aleksandra and Dimitrova, Vesna and Gligoroski, Danilo (2009) On a Conditional Collision Attack on NaSHA-512. IACR Cryptology ePrint Archive 2009.

[thumbnail of 034.pdf]
Preview
Text
034.pdf

Download (134kB) | Preview

Abstract

A collision attack on NaSHA-512 was proposed by L. Ji et al. The claimed complexity of the attack is 2^{192}. The proposed attack is realized by using a suitable differential pattern. In this note we show
that the correct result that can be inferred from their differential pattern is in fact a conditional one. It can be stated correctly as follows: A collision attack on NaSHA-512 of complexity k = 1, 2, ... 2^{320}
can be performed with an unknown probability of success p_k, where 0 <= p_1 <=p_2 <= p_2^{320} <= 1. Consequently, the attack proposed by L. Ji et al. can be considered only as a direction how a possible collision attack on NaSHA-512 could be realized. The birthday attack remains
the best possible attack on NaSHA-512.

Item Type: Other
Subjects: Natural sciences > Computer and information sciences
Natural sciences > Matematics
Divisions: Faculty of Computer Science
Depositing User: Aleksandra Mileva
Date Deposited: 30 Oct 2012 20:53
Last Modified: 30 Oct 2012 20:53
URI: https://eprints.ugd.edu.mk/id/eprint/90

Actions (login required)

View Item View Item