Attacking reduced round SHA-256

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

Volumn 5037 LNCS, Issue , 2008, Pages 130-143

  Sanadhya, Somitra Kumar ^a   Sarkar, Palash ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; CRYPTOGRAPHY; FUNCTIONS; INTERNET; METROPOLITAN AREA NETWORKS; MICROFLUIDICS; NETWORK PROTOCOLS; NETWORK SECURITY;

APPLIED CRYPTOGRAPHY; HASH FUNCTIONS; HEIDELBERG (CO); INTERNATIONAL CONFERENCES; MESSAGE PAIRS; NEAR COLLISIONS; PARITY-CHECK EQUATIONS; SPRINGER (CO); WORD LEVEL;

FUNCTION EVALUATION;

EID: 45749105976     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68914-0_8     Document Type: Conference Paper

References (23)

1. Biham, E., Chen, R.: Near-Collisions of SHA-0. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 290-305. Springer, Heidelberg (2004)
2. Canteaut, A., Chabaud, F.: 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. IEEE Transactions on Information Theory 44(1), 367-378 (1998)
3. Chabaud, F., Joux, A.: Differential Collisions in SHA-0. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 56-71. Springer, Heidelberg (1998)
4. Cramer, R.J.F. (ed.): EUROCRYPT 2005. LNCS, vol. 3494. Springer, Heidelberg (2005)
5. 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)
6. P. Hawkes, M. Paddon, G.G. Rose. On Corrective Patterns for the SHA-2 Family. Cryptology eprint Archive (August 2004), http://eprint.iacr.org/2004/207
7. Hölbl, M., Rechberger, C., Welzer, T.: Finding Message Pairs Conforming to Simple SHA-256 Characteristics. In: Lucks, S., Sadeghi, A.-R., Wolf, C. (eds.) Stefan Lucks, Ahmad-Reza Sadeghi, and Christopher Wolf, editors, Preliminary Proceeding Records of WEWoRC 2007 - Western European Workshop on Research in Cryptology, Bochum, Germany, pp. 21-25 (2007), http://www.hgi.rub. de/weworc07/PreliminaryConferenceRecord.pdf
8. Leon, J.S.: A Probabilistic Algorithm for Computing Minimum Weights of Large Error-Correcting Codes. IEEE Transactions on Information Theory 34(5), 1354-1359 (1988)
9. Matusiewicz, K.: Analysis of Modern Dedicated Cryptographic Hash Functions. PhD thesis, Macquarie University (August 2007), http://www.ics.mq. edu.au/∼kmatus/Matusiewicz-PhDthesis.pdf
10. 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 2005 - Western European Workshop on Research in Cryptology, Leuven, Belgium, July 5-7, 2005. LNI, vol. 74, pp. 123-134. GI (2005)
11. Mendel, F., Pramstaller, N., Rechberger, C., Rijmen, V.: Analysis of Step-Reduced SHA-256. In: Robshaw, M.J.B. (ed.) FSE 2006. LNCS, vol. 4047, pp. 126-143. Springer, Heidelberg (2006)
12. Mendel, F., Pramstaller, N., Rechberger, C., Rijmen, V.: Analysis of Step-Reduced SHA-256. Cryptology eprint Archive (March 2008), http://eprint.iacr.org/2008/130
13. Nikolić, I., Biryukov, A.: Collisions for Step-Reduced SHA-256. In: Nyberg, K. (ed.) Fast Software Encryption 2008. volume Pre-proceedings version of Lecture Notes in Computer Science, pp. 1-16. Springer, Heidelberg (2008)
14. Pramstaller, N., Rechberger, C., Rijmen, V.: Exploiting Coding Theory for Collision Attacks on SHA-1. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 78-95. Springer, Heidelberg (2005)
15. Rijmen, V., Oswald, E.: Update on SHA-1. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 58-71. Springer, Heidelberg (2005)
16. Sanadhya, S.K., Sarkar, P.: New Local Collisions for the SHA-2 Hash Family. In: Nam, K.-H., Rhee, G. (eds.) ICISC 2007. LNCS, vol. 4817, pp. 193-205. Springer, Heidelberg (2007)
17. Sanadhya, S.K., Sarkar, P.: Attacking Reduced Round SHA-256. Cryptology eprint Archive (March 2008), http://eprint.iacr.org/2008/142
18. Secure Hash Standard. Federal Information Processing Standard Publication 180-2. U.S. Department of Commerce, National Institute of Standards and Technology (NIST) (2002), http://csrc.nist.gov/publications/fips/fips180-2/ fips180-2withchangenotice.pdf
19. Stern, J.: A Method for Finding Codewords of Small Weight. In: Wolfmann, J., Cohen, G. (eds.) Coding Theory 1988. LNCS, vol. 388, pp. 106-113. Springer, Heidelberg (1989)
20. Wang, X., Lai, X., Feng, D., Chen, H., Yu, X.: Cryptanalysis of the Hash Functions MD4 and RIPEMD. In: Cramer [4], pp. 1-18
21. 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)
22. Wang, X., Yu, H.: How to Break MD5 and Other Hash Functions. In: Cramer [4], pp. 19-35
23. 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)