New local collisions for the SHA-2 hash family

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4817 LNCS, Issue , 2007, Pages 193-205

  Sanadhya, Somitra Kumar ^a   Sarkar, Palash ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; BOOLEAN FUNCTIONS; COLLISION AVOIDANCE; COMPUTATIONAL METHODS; LINEARIZATION; PROBABILITY;

HASH FAMILY; IMPOSSIBLE CONDITIONS; LINEAR APPROXIMATIONS;

COMPUTER CRIME;

EID: 38149131741     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76788-6_16     Document Type: Conference Paper

References (15)

1. Biham, E., Chen, R., Joux, A., Carribault, P., Lemuet, C., Jalby, W.: Collisions of SHA-0 and reduced SHA-I. In: Cramer [3], pp. 36-57
2. Chabaud, F., Joux, A.: Differential collisions in SHA-0. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 56-71. Springer, Heidelberg (1998)
3. Cramer, R.J.F. (ed.): EUROCRYPT 2005. LNCS, vol. 3494, pp. 22-26. Springer, Heidelberg (2005)
4. Gilbert, H., Handschuh, H.: Security analysis of SHA-256 and sisters. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 175-193. Springer, Heidelberg (2004)
5. Hawkes, P., Paddon, M., Rose, G.G.: On corrective patterns for the SHA-2 family. Cryptology ePrint Archive, Report 2004/207 (August 2004), http://eprint.iacr.org/2004/207
6. Matusiewicz, K., Pieprzyk, J., Pramstaller, N., Rechberger, C., Rijmen, V.: Analysis of simplified variants of SHA-256. In: Wolf, C., Lucks, S., Yau, P.-W. (eds.) WEWoRC, GI. LNI, vol. 74, pp. 123-134 (2005)
7. Mendel, F., Pramstaller, N., Rechberger, C., Rijmen, V.: Analysis of step-reduced SHA-256. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol. 4047, pp. 126-143. Springer, Heidelberg (2006)
8. Rijmen, V., Oswald, E.: Update on SHA-1. In: Menezes, A.J. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 58-71. Springer, Heidelberg (2005)
9. Sanadhya, S.K., Sarkar, P.: New local collisions for the SHA-2 hash family. Cryptology ePrint Archive, Report 2007/352 (September 2007), http://eprint.iacr.org/2007/352
10. Secure Hash Standard. Federad Information Processing Standard Publication 180-2. U.S. Department of Commerce, National Institute of Standards and Technology(NIST) (2002), available at: http://csrc.nist.gov/encryption/tkhash. html
11. Wang, X., Lai, X., Feng, D., Chen, H., Yu, X.: Cryptanalysis of the hash functions MD4 and RIPEMD. In: Cramer [3], pp. 1-18
12. Wang, X., Yin, Y.L., Yu, H.: Finding collisions in the full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 17-36. Springer, Heidelberg (2005)
13. Wang, X., Yu, H.: How to break MD5 and other hash functions. In: Cramer [3], pp. 19-35
14. Wolfram, S.: The Mathematica Book. Wolfram Media, 5th edn. (2003), http://www.wolfram.com
15. Yoshida, H., Biryukov, A.: Analysis of a SHA-256 variant. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 245-260. Springer, Heidelberg (2006)