2011 | OriginalPaper | Buchkapitel
Preimage Attacks on Full-ARIRANG (Poster)
verfasst von : Chiaki Ohtahara, Keita Okada, Yu Sasaki, Takeshi Shimoyama
Erschienen in: Information Security and Privacy
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.