Paper 2013/589

Smashing MASH-1

Vladimir Antipkin

Abstract

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 can be constructed.

Note: Typos and wording are corrected in revised version

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. CTCrypt 2013
Keywords
hash functioncollision attackmulticollisionsMASH-1
Contact author(s)
antip-vova58 @ yandex ru
History
2014-02-15: revised
2013-09-14: received
See all versions
Short URL
https://ia.cr/2013/589
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/589,
      author = {Vladimir Antipkin},
      title = {Smashing {MASH}-1},
      howpublished = {Cryptology {ePrint} Archive, Paper 2013/589},
      year = {2013},
      url = {https://eprint.iacr.org/2013/589}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.