Preimage Attacks on Full-ARIRANG (Poster)
C Ohtahara, K Okada, Y Sasaki…�- Information Security and�…, 2011 - Springer
C Ohtahara, K Okada, Y Sasaki, T Shimoyama
Information Security and Privacy: 16th Australasian Conference, ACISP 2011�…, 2011•SpringerThis paper presents ongoing work toward the first preimage attacks on hash function
ARIRANG, which is one of the first round candidates in the SHA-3 competition. ARIRANG
has an unique design where the feed-forward operation is computed not only after the last
step but also in a middle step. In fact, this design prevents previous preimage attacks. We
apply a meet-in-the-middle preimage attacks to ARIRANG. Specifically, we propose a new
initial-structure optimized for ARIRANG and overcome the middle feed-forward.
ARIRANG, which is one of the first round candidates in the SHA-3 competition. ARIRANG
has an unique design where the feed-forward operation is computed not only after the last
step but also in a middle step. In fact, this design prevents previous preimage attacks. We
apply a meet-in-the-middle preimage attacks to ARIRANG. Specifically, we propose a new
initial-structure optimized for ARIRANG and overcome the middle feed-forward.
Abstract
This paper presents ongoing work toward the first preimage attacks on hash function ARIRANG, which is one of the first round candidates in the SHA-3 competition. ARIRANG has an unique design where the feed-forward operation is computed not only after the last step but also in a middle step. In fact, this design prevents previous preimage attacks. We apply a meet-in-the-middle preimage attacks to ARIRANG. Specifically, we propose a new initial-structure optimized for ARIRANG and overcome the middle feed-forward.
Springer
Showing the best result for this search. See all results