Optimal covering codes for finding near-collisions

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

Volumn 6544 LNCS, Issue , 2011, Pages 187-197

  Lamberger, Mario ^a   Rijmen, Vincent ^a,b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b Interdisciplinary Institute for Broadband Technology   (Belgium)

Author keywords

covering codes; digital expansions; direct sum construction; Hash functions; memoryless near collisions

Indexed keywords

CODING THEORY; COVERING CODES; CRYPTOGRAPHIC HASH FUNCTIONS; DIGITAL EXPANSIONS; DIRECT SUM; GENERIC METHOD; MEMORYLESS; NEAR-COLLISIONS; OPTIMAL SOLUTIONS;

COMPUTER PROGRAMMING; HASH FUNCTIONS; OPTIMAL SYSTEMS; OPTIMIZATION;

CODES (SYMBOLS);

EID: 79952608890     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19574-7_13     Document Type: Conference Paper

References (24)

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. Brent, R.P.: An improved Monte Carlo factorization algorithm. BIT 20(2), 176-184 (1980)
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) (Pubitemid 128118997)
4. Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering codes. North-Holland Mathematical Library, vol. 54. North-Holland Publishing Co., Amsterdam (1997)
5. De Cannìere, C., Mendel, F., Rechberger, C.: Collisions for 70-Step SHA-1: On the Full Cost of Collision Search. In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol. 4876, pp. 56-73. Springer, Heidelberg (2007) (Pubitemid 351153077)
6. De Cannìere, C., Rechberger, C.: Finding SHA-1 Characteristics: General Results and Applications. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 1-20. Springer, Heidelberg (2006)
7. Dobbertin, H.: Cryptanalysis of MD4. J. Cryptology 11(4), 253-271 (1998) (Pubitemid 128728056)
8. Feller, W.: An introduction to probability theory and its applications, 3rd edn., vol. I. John Wiley & Sons Inc., New York (1968)
9. Ḱeri, G.: Tables for bounds on covering codes, http://www.sztaki.hu/~keri/codes/ (accessed May 17, 2010)
10. Gordon, D., Miller, V., Ostapenko, P.: Optimal hash functions for approximate matches on the n-cube. IEEE Trans. Inform. Theory 56(3), 984-991 (2010)
11. Graham, R.L., Sloane, N.J.A.: On the covering radius of codes. IEEE Trans. Inform. Theory 31(3), 385-401 (1985)
12. Knuth, D.E.: The art of computer programming. Seminumerical algorithms, Addison-Wesley Series in Computer Science and Information Processing, vol. 2. Addison-Wesley Publishing Co., Reading (1997)
13. Lamberger, M., Mendel, F., Rijmen, V., Simoens, K.: Memoryless Near- Collisions via Coding Theory (December 2009), http://asiacrypt2009. cipher.risk.tsukuba.ac.jp/rump/slides/13 NC-talk.pdf, (short talk) presented at the ASIACRYPT 2009 rump session
14. Mendel, F., Schläffer, M.: On Free-Start Collisions and Collisions for TIB3. In: Samarati, P., Yung, M., Martinelli, F., Ardagna, C.A. (eds.) ISC 2009. LNCS, vol. 5735, pp. 95-106. Springer, Heidelberg (2009)
15. Menezes, A., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)
16. National Institute of Standards and Technology (NIST). Cryptographic Hash Project (2007), http://www.nist.gov/hash-competition
17. Nivasch, G.: Cycle detection using a stack. Inf. Process. Lett. 90(3), 135-140 (2004)
18. 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) (Pubitemid 43774828)
19. Struik, R.: An improvement of the VanWee bound for binary linear covering codes. IEEE Transactions on Information Theory 40(4), 1280-1284 (1994)
20. van Oorschot, P.C., Wiener, M.J.: Parallel Collision Search with Cryptanalytic Applications. J. Cryptology 12(1), 1-28 (1999)
21. van Wee, G.J.M.: Improved sphere bounds on the covering radius of codes. IEEE Transactions on Information Theory 34(2), 237-245 (1988)
22. 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) (Pubitemid 43902104)
23. Wang, X., Yu, H.: How to Break MD5 and Other Hash Functions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 19-35. Springer, Heidelberg (2005) (Pubitemid 41313944)
24. Yuval, G.: How to swindle Rabin? Cryptologia 3(3), 187-191 (1979)