Second Preimage Attack on SHAMATA-512

Authors:
Kota Ideguchi;Dai Watanabe
Affiliations:
Systems Development Laboratory, Hitachi, LTD,;Systems Development Laboratory, Hitachi, LTD,
Venue:
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Year:
2009

Citing 5
Cited 0

Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard

Computer
Meet-in-the-Middle Attacks on SHA-3 Candidates

Fast Software Encryption
Practical Collisions for SHAMATA-256

Selected Areas in Cryptography
Finding SHA-1 characteristics: general results and applications

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Finding collisions in the full SHA-1

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a second preimage attack on SHAMATA-512, which is a hash function of 512-bit output and one of the first round candidates of the SHA-3 competition. The attack controls several message blocks to fix some variables of internal state and uses a meet-in-the-middle approach to find second preimages. The time complexity is about 2452.7 computations of the step function and the memory complexity is about 2451.4 blocks of 128 bits.