Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find






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


Prikladnaya Diskretnaya Matematika. Supplement, 2012, Issue 5, Pages 43–44 (Mi pdma22)  

This article is cited in 1 scientific paper (total in 1 paper)

Mathematical Methods of Cryptography and Steganography

Estimates of collision resistance complexity for the hash function RIPEMD

G. A. Karpunina, E. Z. Ermolaevab

a Faculty of Computational Mathematics and Cybernetics, M. V. Lomonosov Moscow State University, Moscow
b Moscow
Full-text PDF (348 kB) Citations (1)
References:
Abstract: In 2005, Wang et al. developed practical collision attacks on MD4 and RIPEMD hash functions. For RIPEMD however, description of the attack has been presented only at ideological level, raising concerns about the attack complexity claimed by the authors. X. Wang et al. stated that the attack complexity is about $2^{18}$ calls of compression function. In this paper, the omitted details of the Wang attack on RIPEMD hash function are recovered and the single-step message modification being the first stage of this attack is implemented. The experiments showed that the lower bound of the average complexity of the Wang's attack is greater than $2^{32,49}$ compression function calls. This estimation is significantly higher than the one stated in the Wang's paper.
Document Type: Article
UDC: 519.7+004.056.2+004.056.53
Language: Russian
Citation: G. A. Karpunin, E. Z. Ermolaeva, “Estimates of collision resistance complexity for the hash function RIPEMD”, Prikl. Diskr. Mat. Suppl., 2012, no. 5, 43–44
Citation in format AMSBIB
\Bibitem{KarErm12}
\by G.~A.~Karpunin, E.~Z.~Ermolaeva
\paper Estimates of collision resistance complexity for the hash function RIPEMD
\jour Prikl. Diskr. Mat. Suppl.
\yr 2012
\issue 5
\pages 43--44
\mathnet{http://mi.mathnet.ru/pdma22}
Linking options:
  • https://www.mathnet.ru/eng/pdma22
  • https://www.mathnet.ru/eng/pdma/y2012/i5/p43
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Prikladnaya Diskretnaya Matematika. Supplement
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024