Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Vopr. Kriptogr.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography], 2014, Volume 5, Issue 2, Pages 21–28
DOI: https://doi.org/10.4213/mvk113
(Mi mvk113)
 

Smashing MASH-1

V. G. Antipkin

Technical committee for standardization (TC 26), Moscow
References:
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 may be constructed.
Key words: hash-functions based on modular arithmetic, collision attack, MASH-1.
Received 25.IX.2013
Document Type: Article
UDC: 519.719.2+511.334
Language: English
Citation: V. G. Antipkin, “Smashing MASH-1”, Mat. Vopr. Kriptogr., 5:2 (2014), 21–28
Citation in format AMSBIB
\Bibitem{Ant14}
\by V.~G.~Antipkin
\paper Smashing MASH-1
\jour Mat. Vopr. Kriptogr.
\yr 2014
\vol 5
\issue 2
\pages 21--28
\mathnet{http://mi.mathnet.ru/mvk113}
\crossref{https://doi.org/10.4213/mvk113}
Linking options:
  • https://www.mathnet.ru/eng/mvk113
  • https://doi.org/10.4213/mvk113
  • https://www.mathnet.ru/eng/mvk/v5/i2/p21
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математические вопросы криптографии
    Statistics & downloads:
    Abstract page:271
    Full-text PDF :172
    References:49
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024