On probability characteristics of random graphs generated by algorithms for finding hash function collisions | Applied Discrete Mathematics. Supplement. 2013. № 6.

HomeIssuesOn probability characteristics of random graphs generated by algorithms for finding hash function collisions | Applied Discrete Mathematics. Supplement. 2013. № 6.

On probability characteristics of random graphs generated by algorithms for finding hash function collisions

In the paper, a graph model of some algorithms for finding SHA-1 and RIPEMD collisions is described, and under the described model, an exact formula for calculating average complexity of these algorithms is given.

Download file
Counter downloads: 287

Keywords

криптографические хэш-функции, коллизии, случайные графы, cryptographic hash functions, collisions, random graphs

Authors

NameOrganizationE-mail
Karpunin G. A.Lomonosov Moscow State Universitykarpunin@cs.msu.su
Всего: 1

References

De Canniere C. and Rechberger C. Finding SHA-1 characteristics: general results and applications // ASIACRYPT-2006. LNCS. 2006. V.4284. P. 1-20.
Wang X., Lai X., Feng D., et al. Cryptanalysis of the hash functions MD4 and RIPEMD // EUR0CRYPT-2005. LNCS. 2005. V.3494. P. 1-18.
Ермолаева Е. З., Карпунин Г. А. Оценки сложности поиска коллизий для хэш-функции RIPEMD // Прикладная дискретная математика. Приложение. 2012. №5. С. 43-44.
On probability characteristics of random graphs generated by algorithms for finding hash function collisions | Applied Discrete Mathematics. Supplement. 2013. № 6.

On probability characteristics of random graphs generated by algorithms for finding hash function collisions | Applied Discrete Mathematics. Supplement. 2013. № 6.