Searching for Messages Conforming to Arbitrary Sets of Conditions in SHA-256

DOI10.1007/978-3-540-88353-1_3zbMATH Open1166.94314OpenAlexW2179381609MaRDI QIDQ5504547FDOQ5504547

Authors: Marko Hölbl, Christian Rechberger, Tatjana Welzer 

Publication date: 22 January 2009

Published in: Research in Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88353-1_3

Recommendations

• Finding SHA-2 characteristics: searching through a minefield of contradictions
• Collisions for Step-Reduced SHA-256
• Attacking Reduced Round SHA-256
• Second-order differential collisions for reduced SHA-256
• Analysis of Step-Reduced SHA-256

zbMATH Keywords

hash functionconditionsSHA-256differential collision search

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Finding Collisions in the Full SHA-1
• Title not available (Why is that?)
• How to Break MD5 and Other Hash Functions
• Collisions of SHA-0 and Reduced SHA-1
• Selected Areas in Cryptography
• Analysis of Step-Reduced SHA-256
• Topics in Cryptology – CT-RSA 2005
• Analysis of a SHA-256 Variant

Cited In (3)

• Collisions and Other Non-random Properties for Step-Reduced SHA-256
• Analyze SHA-1 in message schedule
• Finding SHA-2 characteristics: searching through a minefield of contradictions

This page was built for publication: Searching for Messages Conforming to Arbitrary Sets of Conditions in SHA-256

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504547)