Geodesic
Smashing MASH-1
Matematičeskie voprosy kriptografii, Tome 5 (2014) no. 2, pp. 21-28 
V. G. Antipkin. Smashing MASH-1. Matematičeskie voprosy kriptografii, Tome 5 (2014) no. 2, pp. 21-28. http://geodesic.mathdoc.fr/item/MVK_2014_5_2_a2/
@article{MVK_2014_5_2_a2,
     author = {V. G. Antipkin},
     title = {Smashing {MASH-1}},
     journal = {Matemati\v{c}eskie voprosy kriptografii},
     pages = {21--28},
     year = {2014},
     volume = {5},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MVK_2014_5_2_a2/}
}
TY  - JOUR
AU  - V. G. Antipkin
TI  - Smashing MASH-1
JO  - Matematičeskie voprosy kriptografii
PY  - 2014
SP  - 21
EP  - 28
VL  - 5
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MVK_2014_5_2_a2/
LA  - en
ID  - MVK_2014_5_2_a2
ER  - 
%0 Journal Article
%A V. G. Antipkin
%T Smashing MASH-1
%J Matematičeskie voprosy kriptografii
%D 2014
%P 21-28
%V 5
%N 2
%U http://geodesic.mathdoc.fr/item/MVK_2014_5_2_a2/
%G en
%F MVK_2014_5_2_a2

Voir la notice de l'article provenant de la source Math-Net.Ru

MASH-1 is modular arithmetic based hash function. It is presented in Part 4 of ISO/IEC 10118 standard for one and a half decade. Cryptographic strength of MASH-1 hash function is based on factorization problem of an RSA modulus along with redundancy in the input blocks of compression functions. Despite of this, we are able to introduce two large classes of moduli which allow practical time collision finding algorithm for MASH-1. In one case even multicollisions of arbitrary length may be constructed.

[1] Information technology – Security techniques – Hash-functions, Part 1: General, ISO/IEC 10118-1, 2000; Part 2: Hash-functions using an $n$-bit block cipher algorithm, ISO/IEC 10118-2, 2000; Part 3: Dedicated hash-functions, ISO/IEC 10118-3, 2003; Part 4: Hash-functions using modular arithmetic, ISO/IEC 10118-4, 1998