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

DOI10.1007/978-3-540-88353-1_3MaRDI QIDQ5504547zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

hash functionconditionsSHA-256differential collision search

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

• scientific article; zbMATH DE number 1302838 (Why is no real title available?)
• Analysis of Step-Reduced SHA-256
• Analysis of a SHA-256 Variant
• Collisions of SHA-0 and Reduced SHA-1
• Finding Collisions in the Full SHA-1
• How to Break MD5 and Other Hash Functions
• Selected Areas in Cryptography
• Topics in Cryptology – CT-RSA 2005

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)