Memoryless near-collisions via coding theory

Designs, Codes, and Cryptography

Volumn 62, Issue 1, 2012, Pages 1-18

  Lamberger, Mario ^a   Mendel, Florian ^a   Rijmen, Vincent ^b   Simoens, Koen ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b IBBT   (Belgium)

Author keywords

Covering codes; Cycle finding algorithms; Hash functions; Near collisions

Indexed keywords

COMPUTER PROGRAMMING;

COVERING CODES; COVERING RADIUS; CRYPTOGRAPHIC HASH FUNCTIONS; CYCLE FINDING ALGORITHMS; GENERIC APPROACH; GENERIC METHOD; NEAR-COLLISIONS; SHA-3 CANDIDATES;

HASH FUNCTIONS;

EID: 84856209903     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-011-9484-2     Document Type: Article

References (31)

1. A. Barg G.D. Forney Jr. 2002 Random codes: minimum distances and error exponents IEEE Trans. Inf. Theory 48 9 2568 2573 10.1109/TIT.2002.800480 1062.94005 1929465 (Pubitemid 35032681)
2. R.P. Brent 1980 An improved Monte Carlo factorization algorithm BIT 20 2 176 184 10.1007/BF01933190 0439.65001 583032
3. Canetti R., Rivest R.L., Sudan M., Trevisan L., Vadhan S.P., Wee H.: Amplifying collision resistance: a complexity-theoretic treatment. In: Menezes, A. (ed.) CRYPTO, Lecture Notes in Computer Science, vol. 4622, pp. 264-283. Springer, Heidelberg (2007)
4. Cohen G., Honkala I., Litsyn S., Lobstein A.: Covering codes, vol. 54 of North-Holland Mathematical Library. North-Holland Publishing Co., Amsterdam (1997)
5. Cohen H., Frey G., Avanzi R., Doche C., Lange T., Nguyen K., Vercauteren F. (eds.): Handbook of Elliptic and Hyperelliptic Curve Cryptography. Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, Boca Raton, FL (2006).
6. Damgård I.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO, Lecture Notes in Computer Science, vol. 435, pp. 416-427. Springer, Heidelberg (1989)
7. den Boer B., Bosselaers A.: Collisions for the compression function of MD5. In: Goos, G., Hartmanis, J. (eds) EUROCRYPT, Lecture Notes in Computer Science, vol. 765, pp. 293-304. Springer, Heidelberg (1993)
8. D. Gordon V. Miller P. Ostapenko 2010 Optimal hash functions for approximate matches on the n-cube IEEE Trans. Inform. Theory 56 3 984 991 10.1109/TIT.2009.2039037 2723654
9. R.L. Graham N.J.A. Sloane 1985 On the covering radius of codes IEEE Trans. Inform. Theory 31 3 385 401 10.1109/TIT.1985.1057039 0585.94012 794436
10. B. Harris 1960 Probability distributions related to random mappings Ann. Math. Stat. 31 1045 1062 10.1214/aoms/1177705677 0158.34905
11. Kéri G.: Tables for bounds on covering codes. http://www.sztaki. hu/~keri/codes/. Accessed 17 May 2010.
12. Knuth D.E.: The art of computer programming. Seminumerical algorithms, Addison-Wesley Series in Computer Science and Information Processing, vol. 2, third edn. Addison-Wesley Publishing Co., Reading, MA, (1997).
13. S.M. Matyas C.H. Meyer J. Oseas 1985 Generating strong one-way functions with crypographic algorithm IBM Tech. Discl. Bull. 27 10A 5658 5659
14. Mendel F., Schläffer M.: On free-start collisions and collisions for TIB3. In: Samarati P., Yung M., Martinelli F., Ardagna C.A. (ed) ISC, Lecture Notes in Computer Science, 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. Merkle R.C.: One way hash functions and DES. In: Brassard G. (ed.) CRYPTO, Lecture Notes in Computer Science, vol. 435, pp. 428-446. Springer, Heidelberg (1989).
17. Montes M., Penazzi D.: The TIB3 Hash. Submission to NIST (2008).
18. National Institute of Standards and Technology (NIST): FIPS-180-2: Secure Hash Standard. http://www.itl.nist.gov/fipspubs/ (2002).
19. National Institute of Standards and Technology (NIST): Cryptographic Hash Project. http://www.nist.gov/hash-competition (2007).
20. G. Nivasch 2004 Cycle detection using a stack Inf. Process. Lett. 90 3 135 140 10.1016/j.ipl.2004.01.016 1178.68648 2052030
21. Pless V.: Introduction to the theory of error-correcting codes. Wiley-Interscience Series in Discrete Mathematics and Optimization, third edn. Wiley, New York (1998)
22. J.M. Pollard 1978 Monte Carlo methods for index computation (mod p) Math. Comp. 32 143 918 924 0382.10001 491431
23. Quisquater J.-J., Delescaille J.-P.: How easy is collision search. new results and applications to DES. In: Brassard G. (ed.) CRYPTO Lecture Notes in Computer Science, vol. 435, pp. 408-413. Springer, Heidelberg (1989).
24. Rivest R.: RFC1321-The MD5 Message-Digest Algorithm (1992).
25. R. Struik 1994 An improvement of the Van Wee bound for binary linear covering codes IEEE Trans. Inform. Theory 40 4 1280 1284 10.1109/18.335936 0813.94023 1301433
26. van Oorschot P.C., Wiener M.J.: Improving implementable meet-in-the-middle attacks by orders of magnitude. In: Koblitz N. (ed.) CRYPTO, Lecture Notes in Computer Science, vol. 1109, pp. 229-236. Springer, Heidelberg (1996). (Pubitemid 126106243)
27. P.C. van Oorschot M.J. Wiener 1999 Parallel collision search with cryptanalytic applications J. Cryptol. 12 1 1 28 10.1007/PL00003816 0992.94028
28. G.J.M. van Wee 1988 Improved sphere bounds on the covering radius of codes IEEE Trans. Inform. Theory 34 2 237 245 10.1109/18.2632 0653.94014 945316 (Pubitemid 18639976)
29. Wang X., Yu H.: How to break MD5 and other hash functions. In: Cramer, R. (ed.) EUROCRYPT, Lecture Notes in Computer Science, vol. 3494, pp. 19-35. Springer, Heidelberg (2005) (Pubitemid 41313944)
30. Wang X., Yin Y.L., Yu H.: Finding collisions in the full SHA-1. In: Shoup, V. (ed.) CRYPTO, Lecture Notes in Computer Science, vol. 3621, pp. 17-36. Springer, Heidelberg (2005) (Pubitemid 43902104)
31. G. Yuval 1979 How to swindle Rabin? Cryptologia 3 3 187 191 10.1080/0161-117991854025