Memoryless near-collisions, revisited

Information Processing Letters

Volumn 113, Issue 3, 2013, Pages 60-66

  Lamberger, Mario ^a   Teufl, Elmar ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Covering codes; Cryptography; Hash functions; Memoryless near collisions

Indexed keywords

COVERING CODES; CRYPTOGRAPHIC HASH FUNCTIONS; MEMORYLESS; MODIFIED FUNCTION; NEAR-COLLISIONS; OUTPUT BITS;

COMPUTER APPLICATIONS; CRYPTOGRAPHY; DATA PROCESSING;

HASH FUNCTIONS;

EID: 84870384671     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2012.11.004     Document Type: Article

References (22)

1. National Institute of Standards and Technology, Cryptographic Hash Algorithm Competition, 2007.
2. E. Biham, and R. Chen Near-collisions of SHA-0 Advances in Cryptology - CRYPTO 2004 Lecture Notes in Comput. Sci. vol. 3152 2004 Springer Berlin 290 305
3. F. Chabaud, and A. Joux Differential collisions in SHA-0 Advances in Cryptology - CRYPTO 98 Lecture Notes in Comput. Sci. vol. 1462 1998 Springer Berlin 56 71
4. N. Pramstaller, C. Rechberger, and V. Rijmen Exploiting coding theory for collision attacks on SHA-1 Cryptography and Coding Lecture Notes in Comput. Sci. vol. 3796 2005 Springer Berlin 78 95
5. M. Lamberger, F. Mendel, V. Rijmen, and K. Simoens Memoryless near-collisions via coding theory Des. Codes Cryptogr. 62 2012 1 18
6. M. Lamberger, and V. Rijmen Optimal covering codes for finding near-collisions Selected Areas in Cryptography Lecture Notes in Comput. Sci. vol. 6544 2011 Springer Heidelberg 187 197
7. D.M. Gordon, V.S. Miller, and P. Ostapenko Optimal hash functions for approximate matches on the n-cube IEEE Trans. Inform. Theory 56 2010 984 991
8. A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone Handbook of Applied Cryptography CRC Press Series on Discrete Mathematics and Its Applications 1997 CRC Press Boca Raton, FL with a foreword by Ronald L. Rivest
9. G. Yuval How to swindle Rabin Cryptologia 3 1979 187 191
10. R.P. Brent An improved Monte Carlo factorization algorithm BIT 20 1980 176 184
11. D.E. Knuth The art of computer programming, vol. 2 Seminumerical Algorithms third ed. Addison-Wesley Series in Computer Science and Information Processing 1997 Addison-Wesley Publishing Co. Reading, MA
12. G. Nivasch Cycle detection using a stack Inform. Process. Lett. 90 2004 135 140
13. P.C. van Oorschot, and M.J. Wiener Parallel collision search with cryptanalytic applications J. Cryptology 12 1999 1 28
14. P. Flajolet, and A.M. Odlyzko Random mapping statistics Advances in Cryptology - EUROCRYPT 89 Houthalen, 1989 Lecture Notes in Comput. Sci. vol. 434 1990 Springer Berlin 329 354
15. B. Harris Probability distributions related to random mappings Ann. Math. Statist. 31 1960 1045 1062
16. R.P. Stanley Log-concave and unimodal sequences in algebra, combinatorics, and geometry Graph Theory and Its Applications: East and West Jinan, 1986 Ann. New York Acad. Sci. vol. 576 1989 New York Acad. Sci. New York 500 535
17. N.G. de Bruijn Asymptotic Methods in Analysis third ed. 1981 Dover Publications, Inc. New York
18. G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein Covering Codes North-Holland Math. Library vol. 54 1997 North-Holland Publishing Co. Amsterdam
19. R. Struik An improvement of the van Wee bound for binary linear covering codes IEEE Trans. Inform. Theory 40 1994 1280 1284
20. G.J.M. van Wee Improved sphere bounds on the covering radius of codes IEEE Trans. Inform. Theory 34 1988 237 245
21. D.J. Kleitman On a combinatorial conjecture of Erdos J. Combin. Theory 1 1966 209 214
22. S.L. Bezrukov On the description of subsets, maximal with respect to cardinality, of given diameters in Hamming space Problemy Peredachi Informatsii 23 1987 106 109