Attacking Reduced Round SHA-256

DOI10.1007/978-3-540-68914-0_8zbMath1319.94082OpenAlexW1496589496MaRDI QIDQ3506406

Palash Sarkar, Somitra Kumar Sanadhya

Publication date: 13 June 2008

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68914-0_8

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Attacking Reduced Round SHA-256 ⋮ Non-linear Reduced Round Attacks against SHA-2 Hash Family ⋮ Deterministic Constructions of 21-Step Collisions for the SHA-2 Hash Family ⋮ Collisions and Other Non-random Properties for Step-Reduced SHA-256 ⋮ A combinatorial analysis of recent attacks on step reduced SHA-2 family ⋮ New Collision Attacks against Up to 24-Step SHA-2

Cites Work

• Unnamed Item
• Unnamed Item
• Advances in cryptology -- EUROCRYPT 2005. 24th annual international conference on the theory and applications of cryptographic techniques, Aarhus, Denmark, May 22--26, 2005. Proceedings
• Attacking Reduced Round SHA-256
• Collisions for Step-Reduced SHA-256
• Analysis of Step-Reduced SHA-256
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
• Advances in Cryptology – CRYPTO 2004
• Cryptanalysis of the Hash Functions MD4 and RIPEMD
• How to Break MD5 and Other Hash Functions
• Analysis of a SHA-256 Variant
• Finding Collisions in the Full SHA-1
• Topics in Cryptology – CT-RSA 2005
• Selected Areas in Cryptography
• Cryptography and Coding

This page was built for publication: Attacking Reduced Round SHA-256